Implementation of Bogosort algorithm
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.
-
Shuffle the array untill array is sorted.
Author Deep Raval
diff --git a/d8/d69/classgraph_1_1_h_k_graph.html b/d8/d69/classgraph_1_1_h_k_graph.html
new file mode 100644
index 000000000..1b4e3cad1
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph.html
@@ -0,0 +1,482 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: graph::HKGraph Class Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Represents Bipartite graph for Hopcroft Karp implementation.
+ More...
+
+
+
+HKGraph () Default Constructor for initialization. HKGraph (int m , int n ) Constructor for initialization. More... void addEdge (int u, int v) function to add edge from u to v More... bool bfs () This function checks for the possibility of augmented path availability. More... bool dfs (int u) This functions checks whether an augmenting path is available exists beginning with free vertex u. More... int hopcroftKarpAlgorithm () This function counts the number of augmenting paths between left and right sides of the Bipartite graph. More...
+m {} m is the number of vertices on left side of Bipartite Graph n {} n is the number of vertices on right side of Bipartite Graph NIL {0} INF {INT_MAX} std::vector < std::list < int > > adj adj[u] stores adjacents of left side and 0 is used for dummy vertex std::vector < int > pair_u value of vertex 'u' ranges from 1 to m std::vector < int > pair_v value of vertex 'v' ranges from 1 to n std::vector < int > dist dist represents the distance between vertex 'u' and vertex 'v'
+
+
Represents Bipartite graph for Hopcroft Karp implementation.
+
+
+
◆
+
+
+
+
+
+ graph::HKGraph::HKGraph
+ (
+ int
+ m ,
+
+ int
+ n
+
+ )
+
+
+
+
+
Constructor for initialization.
+
Parameters
+
+ m is the number of vertices on left side of Bipartite Graph n is the number of vertices on right side of Bipartite Graph
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ void graph::HKGraph::addEdge
+ (
+ int
+ u ,
+
+ int
+ v
+
+ )
+
+
+
+
+
function to add edge from u to v
+
Parameters
+
+ u is the position of first vertex v is the position of second vertex
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool graph::HKGraph::bfs
+ (
+ )
+
+
+
+
+
This function checks for the possibility of augmented path availability.
+
Returns true if there is an augmenting path available
+false if there is no augmenting path available
+
+
+
+
+
138 for (
int u = 1; u <=
m ; u++)
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
182 return (
dist [NIL] != INF);
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ bool graph::HKGraph::dfs
+ (
+ int
+ u )
+
+
+
+
+
This functions checks whether an augmenting path is available exists beginning with free vertex u.
+
Parameters
+
+ u represents position of vertex
+
+
+
Returns true if there is an augmenting path beginning with free vertex u
+false if there is no augmenting path beginning with free vertex u
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
◆
+
+
+
+
+
+ int graph::HKGraph::hopcroftKarpAlgorithm
+ (
+ )
+
+
+
+
+
This function counts the number of augmenting paths between left and right sides of the Bipartite graph.
+
Returns size of maximum matching
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
114 for (
int u = 1; u <=
m ; u++){
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
The documentation for this class was generated from the following file:
+
+
+
+
int m
m is the number of vertices on left side of Bipartite Graph
Definition: hopcroft_karp.cpp:68
+
int n
n is the number of vertices on right side of Bipartite Graph
Definition: hopcroft_karp.cpp:69
+
+
+
+
bool bfs()
This function checks for the possibility of augmented path availability.
Definition: hopcroft_karp.cpp:133
+
+
std::vector< std::list< int > > adj
adj[u] stores adjacents of left side and 0 is used for dummy vertex
Definition: hopcroft_karp.cpp:73
+
std::vector< int > dist
dist represents the distance between vertex 'u' and vertex 'v'
Definition: hopcroft_karp.cpp:77
+
+
std::vector< int > pair_v
value of vertex 'v' ranges from 1 to n
Definition: hopcroft_karp.cpp:76
+
std::vector< int > pair_u
value of vertex 'u' ranges from 1 to m
Definition: hopcroft_karp.cpp:75
+
bool dfs(int u)
This functions checks whether an augmenting path is available exists beginning with free vertex u.
Definition: hopcroft_karp.cpp:191
+
+
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph.js b/d8/d69/classgraph_1_1_h_k_graph.js
new file mode 100644
index 000000000..bda662e57
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph.js
@@ -0,0 +1,17 @@
+var classgraph_1_1_h_k_graph =
+[
+ [ "HKGraph", "d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9", null ],
+ [ "HKGraph", "d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64", null ],
+ [ "addEdge", "d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a", null ],
+ [ "bfs", "d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93", null ],
+ [ "dfs", "d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0", null ],
+ [ "hopcroftKarpAlgorithm", "d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d", null ],
+ [ "adj", "d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f", null ],
+ [ "dist", "d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a", null ],
+ [ "INF", "d8/d69/classgraph_1_1_h_k_graph.html#a44742cb9cfecd1a4493970af9b8bbb15", null ],
+ [ "m", "d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74", null ],
+ [ "n", "d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c", null ],
+ [ "NIL", "d8/d69/classgraph_1_1_h_k_graph.html#ae6d069bd16d6eafa6e08c7e5f735eda6", null ],
+ [ "pair_u", "d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b", null ],
+ [ "pair_v", "d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77", null ]
+];
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map
new file mode 100644
index 000000000..ffcf09ad7
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5
new file mode 100644
index 000000000..179279ac3
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5
@@ -0,0 +1 @@
+15f4467c23533c0c12ca74642c798856
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg
new file mode 100644
index 000000000..227f15bf0
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+graph::HKGraph::addEdge
+
+Node1
+
+graph::HKGraph::addEdge
+
+
+
+
+Node2
+
+std::vector::push_back
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map
new file mode 100644
index 000000000..d89223337
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5
new file mode 100644
index 000000000..d724dd7f7
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5
@@ -0,0 +1 @@
+4a958172f669039dfd4d2318d4dbf48d
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg
new file mode 100644
index 000000000..2e44370b3
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+graph::HKGraph::bfs
+
+Node1
+
+graph::HKGraph::bfs
+
+
+
+
+Node2
+
+std::vector::end
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map
new file mode 100644
index 000000000..1bf4fd3e4
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5
new file mode 100644
index 000000000..a37ef5e06
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5
@@ -0,0 +1 @@
+8ca3a64ad81d15f892e4f1cb1c1f0ef3
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg
new file mode 100644
index 000000000..2947a3401
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg
@@ -0,0 +1,74 @@
+
+
+
+
+
+
+graph::HKGraph::hopcroftKarpAlgorithm
+
+Node1
+
+graph::HKGraph::hopcroft
+KarpAlgorithm
+
+
+
+
+Node2
+
+graph::HKGraph::bfs
+
+
+
+
+Node1->Node2
+
+
+
+Node4
+
+graph::HKGraph::dfs
+
+
+
+
+Node1->Node4
+
+
+
+Node3
+
+std::vector::end
+
+
+
+
+Node2->Node3
+
+
+
+Node4->Node3
+
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map
new file mode 100644
index 000000000..543edc7cb
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map
@@ -0,0 +1,4 @@
+
+
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5
new file mode 100644
index 000000000..985ae93f9
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5
@@ -0,0 +1 @@
+0a0a39e7d357d82d1aa385bc9971f1dc
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg
new file mode 100644
index 000000000..3ad8c7e00
--- /dev/null
+++ b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg
@@ -0,0 +1,37 @@
+
+
+
+
+
+
+graph::HKGraph::dfs
+
+Node1
+
+graph::HKGraph::dfs
+
+
+
+
+Node2
+
+std::vector::end
+
+
+
+
+Node1->Node2
+
+
+
diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html
index aed9fb950..77d810396 100644
--- a/d8/d95/vector__ops_8hpp_source.html
+++ b/d8/d95/vector__ops_8hpp_source.html
@@ -651,11 +651,13 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
void equal_shuffle(std::vector< std::vector< std::valarray< T >>> &A, std::vector< std::vector< std::valarray< T >>> &B)
Definition: vector_ops.hpp:136
LowestCommonAncestor(const RootedTree &tree_)
Stores the tree and precomputs "up lifts".
Definition: lowest_common_ancestor.cpp:151
T inner_product(T... args)
+
int m
m is the number of vertices on left side of Bipartite Graph
Definition: hopcroft_karp.cpp:68
Entry(int key=notPresent)
constructor
Definition: linear_probing_hash_table.cpp:36
std::vector< std::valarray< T > > operator/(const std::vector< std::valarray< T >> &A, const T &val)
Definition: vector_ops.hpp:365
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:204
+
int n
n is the number of vertices on right side of Bipartite Graph
Definition: hopcroft_karp.cpp:69
bool putProber(const Entry &entry, int key)
Definition: linear_probing_hash_table.cpp:98
std::valarray< T > pop_front(const std::valarray< T > &A)
Definition: vector_ops.hpp:102
An implementation of hash table using double hashing algorithm.
@@ -693,6 +695,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
int main(int argc, char **argv)
Definition: spirograph.cpp:268
Graph(unsigned int vertices, AdjList adjList)
Definition: cycle_check_directed_graph.cpp:68
+
void addEdge(int u, int v)
function to add edge from u to v
Definition: hopcroft_karp.cpp:242
int getConnectedComponents(const std::vector< std::vector< int >> *adj)
Function that perfoms depth first search algorithm on graph and calculated the number of connected co...
Definition: connected_components.cpp:77
void populate_up()
Definition: lowest_common_ancestor.cpp:212
@@ -885,6 +888,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
Entry(int key=notPresent)
constructor
Definition: quadratic_probing_hash_table.cpp:38
Type top()
Definition: stack.h:93
Definition: jarvis_algorithm.cpp:55
+
bool bfs()
This function checks for the possibility of augmented path availability.
Definition: hopcroft_karp.cpp:133
bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)
Definition: hamiltons_cycle.cpp:30
bool deleteString(const std::string &str, int index)
Definition: trie_tree.cpp:134
void tests()
Definition: connected_components.cpp:93
@@ -908,6 +912,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:226
bool search(const std::shared_ptr< trie > &root, const std::string &str, int index)
Definition: trie_tree.cpp:56
std::pair< std::vector< std::vector< std::valarray< double > > >, std::vector< std::vector< std::valarray< double > > > > get_XY_from_csv(const std::string &file_name, const bool &last_label, const bool &normalize, const int &slip_lines=1)
Definition: neural_network.cpp:382
+
int main()
Main function.
Definition: hopcroft_karp.cpp:306
bool searchingProber(const Entry &entry, int key)
Definition: double_hash_hash_table.cpp:133
std::shared_ptr< struct Node > next
pointer to the next node
Definition: chaining.cpp:23
@@ -922,13 +927,16 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
std::pair< size_t, size_t > get_shape(const std::vector< std::valarray< T >> &A)
Definition: vector_ops.hpp:247
+
std::vector< std::list< int > > adj
adj[u] stores adjacents of left side and 0 is used for dummy vertex
Definition: hopcroft_karp.cpp:73
+
HKGraph()
Default Constructor for initialization.
NeuralNetwork & operator=(NeuralNetwork &&)=default
void save_model(const std::string &_file_name)
Definition: neural_network.cpp:652
constexpr double MIN_DISTANCE
Definition: kohonen_som_topology.cpp:129
void removalInfo(int key)
Definition: linear_probing_hash_table.cpp:201
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
int number_of_vertices() const
Definition: lowest_common_ancestor.cpp:74
+
void tests()
Definition: hopcroft_karp.cpp:255
Definition: huffman.cpp:28
double dsigmoid(const double &x)
Definition: neural_network.cpp:67
@@ -956,6 +964,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
Definition: jarvis_algorithm.cpp:47
void test3()
Definition: kohonen_som_trace.cpp:414
+
std::vector< int > dist
dist represents the distance between vertex 'u' and vertex 'v'
Definition: hopcroft_karp.cpp:77
void ols_test()
Definition: ordinary_least_squares_regressor.cpp:369
bool isEmptyStack()
Definition: stack.h:80
This namespace contains layers used in MLP.
@@ -975,7 +984,9 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
int key
key value
Definition: double_hash_hash_table.cpp:38
static int orientation(const Point &p, const Point &q, const Point &r)
Definition: jarvis_algorithm.cpp:133
+
Represents Bipartite graph for Hopcroft Karp implementation.
Definition: hopcroft_karp.cpp:67
const double accuracy
model fit convergence accuracy
Definition: adaline_learning.cpp:208
+
std::vector< int > pair_v
value of vertex 'v' ranges from 1 to n
Definition: hopcroft_karp.cpp:76
int main()
Definition: dijkstra.cpp:152
std::vector< std::valarray< T > > operator+(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
Definition: vector_ops.hpp:406
@@ -986,6 +997,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
Definition: line_segment_intersection.cpp:12
std::vector< std::valarray< T > > hadamard_product(const std::vector< std::valarray< T >> &A, const std::vector< std::valarray< T >> &B)
Definition: vector_ops.hpp:494
Class for representing graph as an adjacency list.
Definition: is_graph_bipartite.cpp:51
+
int hopcroftKarpAlgorithm()
This function counts the number of augmenting paths between left and right sides of the Bipartite gra...
Definition: hopcroft_karp.cpp:95
void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
Definition: kohonen_som_topology.cpp:269
void push(char ch)
push byte to stack variable
Definition: paranthesis_matching.cpp:26
std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
Definition: trie_modern.cpp:64
@@ -1000,6 +1012,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
int lowest_common_ancestor(int u, int v) const
Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...
Definition: lowest_common_ancestor.cpp:164
void display()
Display the chain.
Definition: chaining.cpp:63
+
std::vector< int > pair_u
value of vertex 'u' ranges from 1 to m
Definition: hopcroft_karp.cpp:75
int main()
Definition: shortest_common_supersequence.cpp:164
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
void test2(double eta=0.01)
Definition: adaline_learning.cpp:262
@@ -1015,6 +1028,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
std::vector< float > operator/(std::vector< T > const &A, float const scalar)
Definition: ordinary_least_squares_regressor.cpp:174
void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
Definition: kohonen_som_trace.cpp:149
Various utility functions used in Neural network.
+
bool dfs(int u)
This functions checks whether an augmenting path is available exists beginning with free vertex u.
Definition: hopcroft_karp.cpp:191
void addEdge(int u, int v)
Function that add an edge between two nodes or vertices of graph.
Definition: is_graph_bipartite.cpp:83
diff --git a/d9/d43/hopcroft__karp_8cpp__incl.map b/d9/d43/hopcroft__karp_8cpp__incl.map
new file mode 100644
index 000000000..52ac5f367
--- /dev/null
+++ b/d9/d43/hopcroft__karp_8cpp__incl.map
@@ -0,0 +1,10 @@
+
+
diff --git a/d9/d43/hopcroft__karp_8cpp__incl.md5 b/d9/d43/hopcroft__karp_8cpp__incl.md5
new file mode 100644
index 000000000..ce6f1dbd5
--- /dev/null
+++ b/d9/d43/hopcroft__karp_8cpp__incl.md5
@@ -0,0 +1 @@
+9d0351860954a721fcec403f6f3bd9d1
\ No newline at end of file
diff --git a/d9/d43/hopcroft__karp_8cpp__incl.svg b/d9/d43/hopcroft__karp_8cpp__incl.svg
new file mode 100644
index 000000000..2254fdcaa
--- /dev/null
+++ b/d9/d43/hopcroft__karp_8cpp__incl.svg
@@ -0,0 +1,127 @@
+
+
+
+
+
+
+graph/hopcroft_karp.cpp
+
+Node1
+
+graph/hopcroft_karp.cpp
+
+
+
+
+Node2
+
+iostream
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+cstdlib
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+queue
+
+
+
+
+Node1->Node4
+
+
+
+Node5
+
+list
+
+
+
+
+Node1->Node5
+
+
+
+Node6
+
+climits
+
+
+
+
+Node1->Node6
+
+
+
+Node7
+
+memory
+
+
+
+
+Node1->Node7
+
+
+
+Node8
+
+cassert
+
+
+
+
+Node1->Node8
+
+
+
diff --git a/dc/dea/classgraph_1_1_h_k_graph-members.html b/dc/dea/classgraph_1_1_h_k_graph-members.html
new file mode 100644
index 000000000..cf5244c6a
--- /dev/null
+++ b/dc/dea/classgraph_1_1_h_k_graph-members.html
@@ -0,0 +1,123 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
This is the complete list of members for graph::HKGraph , including all inherited members.
+
+
+
+
+
+
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.map b/df/d82/classgraph_1_1_h_k_graph__coll__graph.map
new file mode 100644
index 000000000..6c80278c1
--- /dev/null
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.map
@@ -0,0 +1,6 @@
+
+
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5 b/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5
new file mode 100644
index 000000000..e2752e5eb
--- /dev/null
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5
@@ -0,0 +1 @@
+6f02041634dc236fe9f0252ed9d79c5f
\ No newline at end of file
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg b/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg
new file mode 100644
index 000000000..5a22dd136
--- /dev/null
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg
@@ -0,0 +1,73 @@
+
+
+
+
+
+
+graph::HKGraph
+
+Node1
+
+graph::HKGraph
+
+
+
+
+Node2
+
+std::vector< std::list
+< int > >
+
+
+
+
+Node2->Node1
+ adj
+
+
+
+Node3
+
+std::list< int >
+
+
+
+
+Node3->Node2
+ elements
+
+
+
+Node4
+
+std::vector< int >
+
+
+
+
+Node4->Node1
+ dist
+pair_u
+pair_v
+
+
+
diff --git a/df/dce/namespacegraph.html b/df/dce/namespacegraph.html
index c70ef3a37..e165c5398 100644
--- a/df/dce/namespacegraph.html
+++ b/df/dce/namespacegraph.html
@@ -106,6 +106,9 @@ $(document).ready(function(){initNavTree('df/dce/namespacegraph.html','../../');
Classes
class Graph
+
class HKGraph
+
Represents Bipartite graph for Hopcroft Karp implementation. More...
+
class LowestCommonAncestor class RootedTree
diff --git a/df/dce/namespacegraph.js b/df/dce/namespacegraph.js
index 2e8db1f75..d25c041a9 100644
--- a/df/dce/namespacegraph.js
+++ b/df/dce/namespacegraph.js
@@ -4,6 +4,7 @@ var namespacegraph =
[ "Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph" ]
] ],
[ "Graph", "dc/d61/classgraph_1_1_graph.html", "dc/d61/classgraph_1_1_graph" ],
+ [ "HKGraph", "d8/d69/classgraph_1_1_h_k_graph.html", "d8/d69/classgraph_1_1_h_k_graph" ],
[ "LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", "d9/d23/classgraph_1_1_lowest_common_ancestor" ],
[ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ]
];
\ No newline at end of file
diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html
index 7b93bac2c..ac11d29e6 100644
--- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html
+++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html
@@ -112,6 +112,9 @@ Files
file hamiltons_cycle.cpp The implementation of Hamilton's cycle dynamic solution for vertices number less than 20.
+
file hopcroft_karp.cpp
+
Implementation of Hopcroft–Karp algorithm.
+
file is_graph_bipartite.cpp Algorithm to check whether a graph is bipartite
diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.js b/dir_12552d7fa429bf94a2e32e5cf39f7e69.js
index b36574232..0f8c6d658 100644
--- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.js
+++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.js
@@ -5,6 +5,7 @@ var dir_12552d7fa429bf94a2e32e5cf39f7e69 =
[ "depth_first_search.cpp", "da/d8d/depth__first__search_8cpp.html", "da/d8d/depth__first__search_8cpp" ],
[ "dijkstra.cpp", "d7/d1e/graph_2dijkstra_8cpp.html", "d7/d1e/graph_2dijkstra_8cpp" ],
[ "hamiltons_cycle.cpp", "dd/d0c/hamiltons__cycle_8cpp.html", "dd/d0c/hamiltons__cycle_8cpp" ],
+ [ "hopcroft_karp.cpp", "d1/d9a/hopcroft__karp_8cpp.html", "d1/d9a/hopcroft__karp_8cpp" ],
[ "is_graph_bipartite.cpp", "d6/dd8/is__graph__bipartite_8cpp.html", "d6/dd8/is__graph__bipartite_8cpp" ],
[ "lowest_common_ancestor.cpp", "de/dde/lowest__common__ancestor_8cpp.html", "de/dde/lowest__common__ancestor_8cpp" ]
];
\ No newline at end of file
diff --git a/files.html b/files.html
index 72b9d8185..6c65fff8a 100644
--- a/files.html
+++ b/files.html
@@ -137,8 +137,9 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
depth_first_search.cpp Depth First Search Algorithm (Depth First Search) dijkstra.cpp Graph Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path) hamiltons_cycle.cpp The implementation of Hamilton's cycle dynamic solution for vertices number less than 20
-
is_graph_bipartite.cpp Algorithm to check whether a graph is bipartite
-
lowest_common_ancestor.cpp Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting
+
hopcroft_karp.cpp Implementation of Hopcroft–Karp algorithm
+
is_graph_bipartite.cpp Algorithm to check whether a graph is bipartite
+
lowest_common_ancestor.cpp Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting ► graphics spirograph.cpp Implementation of Spirograph ► greedy_algorithms
diff --git a/functions_a.html b/functions_a.html
index f5dbb746a..c91133177 100644
--- a/functions_a.html
+++ b/functions_a.html
@@ -116,13 +116,15 @@ $(document).ready(function(){initNavTree('functions_a.html',''); initResizable()
addEdge()
: Graph
+, graph::HKGraph
, graph::is_graph_bipartite::Graph
addVertices()
: Graph
adj
-: graph::is_graph_bipartite::Graph
+: graph::HKGraph
+, graph::is_graph_bipartite::Graph
arg()
: Complex
diff --git a/functions_b.html b/functions_b.html
index fc34f9f5f..8ff382144 100644
--- a/functions_b.html
+++ b/functions_b.html
@@ -96,6 +96,9 @@ $(document).ready(function(){initNavTree('functions_b.html',''); initResizable()
batch_predict()
: machine_learning::neural_network::NeuralNetwork
+
bfs()
+: graph::HKGraph
+
Here is a list of all documented class members with links to the class documentation for each member:
1.8.20
+ 
1.8.20 
