diff --git a/annotated.html b/annotated.html index 0af19919d..5768abc60 100644 --- a/annotated.html +++ b/annotated.html @@ -113,7 +113,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  Njarvis  CConvexhull  CPoint - NgraphGraph algorithms + NgraphGraph Algorithms  Nis_graph_bipartite  CGraphClass for representing graph as an adjacency list  CGraph diff --git a/d1/d9a/hopcroft__karp_8cpp.html b/d1/d9a/hopcroft__karp_8cpp.html index 547bc750e..4642d8d91 100644 --- a/d1/d9a/hopcroft__karp_8cpp.html +++ b/d1/d9a/hopcroft__karp_8cpp.html @@ -124,7 +124,7 @@ Classes

Namespaces

 graphGraph algorithms.
Graph Algorithms.
 
change
static double change(double x, double y)
asserting the test functions
Definition: rungekutta.cpp:31
power
vector< vector< ll > > power(const vector< vector< ll >> &A, ll p)
Definition: matrix_exponentiation.cpp:76
sorting::merge_insertion::InsertionSort
static void InsertionSort(std::array< T, N > *A, size_t start, size_t end)
Insertion merge algorithm.
Definition: merge_insertion_sort.cpp:37
-
graph
Graph algorithms.
+
graph
Graph Algorithms.
main
int main()
Definition: successive_approximation.cpp:20
range_queries::heavy_light_decomposition::HLD::h_parent
std::vector< int > h_parent
stores the top of the heavy chain from a node
Definition: heavy_light_decomposition.cpp:341
test
static void test()
Definition: wiggle_sort.cpp:109
diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html index e3848550c..81f06f066 100644 --- a/d3/dbb/class_cycle_check.html +++ b/d3/dbb/class_cycle_check.html @@ -394,7 +394,7 @@ Here is the call graph for this function:
std::queue::front
T front(T... args)
CycleCheck::isCyclicDFSHelper
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:170
std::queue::pop
T pop(T... args)
-
graph
Graph algorithms.
+
graph
Graph Algorithms.
std::queue::empty
T empty(T... args)
list
Definition: list_array.cpp:9
diff --git a/d4/d13/namespacebidirectional__dijkstra.html b/d4/d13/namespacebidirectional__dijkstra.html new file mode 100644 index 000000000..b1237594b --- /dev/null +++ b/d4/d13/namespacebidirectional__dijkstra.html @@ -0,0 +1,112 @@ + + + + + + + +Algorithms_in_C++: bidirectional_dijkstra Namespace Reference + + + + + + + + + + + + + + + +
+
+

diff --git a/d1/df6/bidirectional__dijkstra_8cpp__incl.map b/d1/df6/bidirectional__dijkstra_8cpp__incl.map new file mode 100644 index 000000000..919cea536 --- /dev/null +++ b/d1/df6/bidirectional__dijkstra_8cpp__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d1/df6/bidirectional__dijkstra_8cpp__incl.md5 b/d1/df6/bidirectional__dijkstra_8cpp__incl.md5 new file mode 100644 index 000000000..da1a122c3 --- /dev/null +++ b/d1/df6/bidirectional__dijkstra_8cpp__incl.md5 @@ -0,0 +1 @@ +fc55b728467bf89b6b5a9215ac8eb5d2 \ No newline at end of file diff --git a/d1/df6/bidirectional__dijkstra_8cpp__incl.svg b/d1/df6/bidirectional__dijkstra_8cpp__incl.svg new file mode 100644 index 000000000..3ff0b6261 --- /dev/null +++ b/d1/df6/bidirectional__dijkstra_8cpp__incl.svg @@ -0,0 +1,113 @@ + + + + + + +graph/bidirectional_dijkstra.cpp + + + +Node1 + + +graph/bidirectional +_dijkstra.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +limits + + + + + +Node1->Node4 + + + + + +Node5 + + +queue + + + + + +Node1->Node5 + + + + + +Node6 + + +utility + + + + + +Node1->Node6 + + + + + +Node7 + + +vector + + + + + +Node1->Node7 + + + + + diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html index b14fa0575..feef5f5f1 100644 --- a/d3/d40/graph__coloring_8cpp.html +++ b/d3/d40/graph__coloring_8cpp.html @@ -480,7 +480,7 @@ Functions

+ + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+ + + + + + + + + +
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
bidirectional_dijkstra Namespace Reference
+
+
+ +

Functions for Bidirectional Dijkstra Shortest Path algorithm. +More...

+

Detailed Description

+

Functions for Bidirectional Dijkstra Shortest Path algorithm.

+
+
+ + + + diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index cc2769e86..65b510e45 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -187,6 +187,7 @@ Geometry

Graph