diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.map b/d3/db7/graph_2dijkstra_8cpp__incl.map index 9e6e0b4eb..a22267031 100644 --- a/d3/db7/graph_2dijkstra_8cpp__incl.map +++ b/d3/db7/graph_2dijkstra_8cpp__incl.map @@ -1,10 +1,10 @@ - + - - - - + + + + diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.md5 b/d3/db7/graph_2dijkstra_8cpp__incl.md5 index d81cef578..5d08138a0 100644 --- a/d3/db7/graph_2dijkstra_8cpp__incl.md5 +++ b/d3/db7/graph_2dijkstra_8cpp__incl.md5 @@ -1 +1 @@ -877fdb92c0ba2d9c99ae6ce6d238974a \ No newline at end of file +9d5ffd57234ed37b1fc971d51b97e81e \ No newline at end of file diff --git a/d3/db7/graph_2dijkstra_8cpp__incl.svg b/d3/db7/graph_2dijkstra_8cpp__incl.svg index 0f1db60a4..a7f12395d 100644 --- a/d3/db7/graph_2dijkstra_8cpp__incl.svg +++ b/d3/db7/graph_2dijkstra_8cpp__incl.svg @@ -13,8 +13,8 @@ Node1 - -graph/dijkstra.cpp + +graph/dijkstra.cpp @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -45,8 +45,8 @@ Node1->Node3 - - + + @@ -60,68 +60,68 @@ Node1->Node4 - - + + Node5 - -queue + +memory Node1->Node5 - - + + Node6 - -utility + +queue Node1->Node6 - - + + Node7 - -vector + +utility Node1->Node7 - - + + Node8 - -memory + +vector Node1->Node8 - - + + diff --git a/d7/d1e/graph_2dijkstra_8cpp.html b/d7/d1e/graph_2dijkstra_8cpp.html index b6bc0621a..29c50f8e2 100644 --- a/d7/d1e/graph_2dijkstra_8cpp.html +++ b/d7/d1e/graph_2dijkstra_8cpp.html @@ -104,10 +104,10 @@ $(document).ready(function(){initNavTree('d7/d1e/graph_2dijkstra_8cpp.html','../
#include <cassert>
#include <iostream>
#include <limits>
+#include <memory>
#include <queue>
#include <utility>
#include <vector>
-#include <memory>
Include dependency graph for dijkstra.cpp:
@@ -164,33 +164,33 @@ constexpr int64_t INF

Main function

152  {
-
153  // running predefined tests
-
154  tests();
+
153  // running predefined tests
+
154  tests();
155 
-
156  int vertices = int(), edges = int();
-
157  std::cout << "Enter the number of vertices : ";
-
158  std::cin >> vertices;
-
159  std::cout << "Enter the number of edges : ";
-
160  std::cin >> edges;
+
156  int vertices = int(), edges = int();
+
157  std::cout << "Enter the number of vertices : ";
+
158  std::cin >> vertices;
+
159  std::cout << "Enter the number of edges : ";
+
160  std::cin >> edges;
161 
-
162  std::vector<std::vector<std::pair<int, int>>> adj(
-
163  vertices, std::vector<std::pair<int, int>>());
+
162  std::vector<std::vector<std::pair<int, int>>> adj(
+
163  vertices, std::vector<std::pair<int, int>>());
164 
-
165  int u = int(), v = int(), w = int();
-
166  while (edges--) {
-
167  std::cin >> u >> v >> w;
-
168  graph::addEdge(&adj, u, v, w);
-
169  }
+
165  int u = int(), v = int(), w = int();
+
166  while (edges--) {
+
167  std::cin >> u >> v >> w;
+
168  graph::addEdge(&adj, u, v, w);
+
169  }
170 
-
171  int s = int(), t = int();
-
172  std::cin >> s >> t;
-
173  int dist = graph::dijkstra(&adj, s - 1, t - 1);
-
174  if (dist == -1) {
-
175  std::cout << "Target not reachable from source" << std::endl;
-
176  } else {
-
177  std::cout << "Shortest Path Distance : " << dist << std::endl;
-
178  }
-
179  return 0;
+
171  int s = int(), t = int();
+
172  std::cin >> s >> t;
+
173  int dist = graph::dijkstra(&adj, s - 1, t - 1);
+
174  if (dist == -1) {
+
175  std::cout << "Target not reachable from source" << std::endl;
+
176  } else {
+
177  std::cout << "Shortest Path Distance : " << dist << std::endl;
+
178  }
+
179  return 0;
180 }
Here is the call graph for this function:
@@ -217,41 +217,41 @@ Here is the call graph for this function:

Function to test the Algorithm

113  {
-
114  std::cout << "Initiatinig Predefined Tests..." << std::endl;
-
115  std::cout << "Initiating Test 1..." << std::endl;
-
116  std::vector<std::vector<std::pair<int, int>>> adj1(
-
117  4, std::vector<std::pair<int, int>>());
-
118  graph::addEdge(&adj1, 1, 2, 1);
-
119  graph::addEdge(&adj1, 4, 1, 2);
-
120  graph::addEdge(&adj1, 2, 3, 2);
-
121  graph::addEdge(&adj1, 1, 3, 5);
+
114  std::cout << "Initiatinig Predefined Tests..." << std::endl;
+
115  std::cout << "Initiating Test 1..." << std::endl;
+
116  std::vector<std::vector<std::pair<int, int>>> adj1(
+
117  4, std::vector<std::pair<int, int>>());
+
118  graph::addEdge(&adj1, 1, 2, 1);
+
119  graph::addEdge(&adj1, 4, 1, 2);
+
120  graph::addEdge(&adj1, 2, 3, 2);
+
121  graph::addEdge(&adj1, 1, 3, 5);
122 
-
123  int s = 1, t = 3;
-
124  assert(graph::dijkstra(&adj1, s - 1, t - 1) == 3);
-
125  std::cout << "Test 1 Passed..." << std::endl;
+
123  int s = 1, t = 3;
+
124  assert(graph::dijkstra(&adj1, s - 1, t - 1) == 3);
+
125  std::cout << "Test 1 Passed..." << std::endl;
126 
-
127  s = 4, t = 3;
-
128  std::cout << "Initiating Test 2..." << std::endl;
-
129  assert(graph::dijkstra(&adj1, s - 1, t - 1) == 5);
-
130  std::cout << "Test 2 Passed..." << std::endl;
+
127  s = 4, t = 3;
+
128  std::cout << "Initiating Test 2..." << std::endl;
+
129  assert(graph::dijkstra(&adj1, s - 1, t - 1) == 5);
+
130  std::cout << "Test 2 Passed..." << std::endl;
131 
-
132  std::vector<std::vector<std::pair<int, int>>> adj2(
-
133  5, std::vector<std::pair<int, int>>());
-
134  graph::addEdge(&adj2, 1, 2, 4);
-
135  graph::addEdge(&adj2, 1, 3, 2);
-
136  graph::addEdge(&adj2, 2, 3, 2);
-
137  graph::addEdge(&adj2, 3, 2, 1);
-
138  graph::addEdge(&adj2, 2, 4, 2);
-
139  graph::addEdge(&adj2, 3, 5, 4);
-
140  graph::addEdge(&adj2, 5, 4, 1);
-
141  graph::addEdge(&adj2, 2, 5, 3);
-
142  graph::addEdge(&adj2, 3, 4, 4);
+
132  std::vector<std::vector<std::pair<int, int>>> adj2(
+
133  5, std::vector<std::pair<int, int>>());
+
134  graph::addEdge(&adj2, 1, 2, 4);
+
135  graph::addEdge(&adj2, 1, 3, 2);
+
136  graph::addEdge(&adj2, 2, 3, 2);
+
137  graph::addEdge(&adj2, 3, 2, 1);
+
138  graph::addEdge(&adj2, 2, 4, 2);
+
139  graph::addEdge(&adj2, 3, 5, 4);
+
140  graph::addEdge(&adj2, 5, 4, 1);
+
141  graph::addEdge(&adj2, 2, 5, 3);
+
142  graph::addEdge(&adj2, 3, 4, 4);
143 
-
144  s = 1, t = 5;
-
145  std::cout << "Initiating Test 3..." << std::endl;
-
146  assert(graph::dijkstra(&adj2, s - 1, t - 1) == 6);
-
147  std::cout << "Test 3 Passed..." << std::endl;
-
148  std::cout << "All Test Passed..." << std::endl << std::endl;
+
144  s = 1, t = 5;
+
145  std::cout << "Initiating Test 3..." << std::endl;
+
146  assert(graph::dijkstra(&adj2, s - 1, t - 1) == 6);
+
147  std::cout << "Test 3 Passed..." << std::endl;
+
148  std::cout << "All Test Passed..." << std::endl << std::endl;
149 }
Here is the call graph for this function:
diff --git a/dd/d0c/hamiltons__cycle_8cpp.html b/dd/d0c/hamiltons__cycle_8cpp.html index 1b5a875c2..795d77066 100644 --- a/dd/d0c/hamiltons__cycle_8cpp.html +++ b/dd/d0c/hamiltons__cycle_8cpp.html @@ -156,49 +156,49 @@ Functions
false if there is no Hamiltonian cycle in the graph
30  {
-
31  const size_t n = routes.size();
-
32  // height of dp array which is 2^n
-
33  const size_t height = 1 << n;
-
34  std::vector<std::vector<bool>> dp(height, std::vector<bool>(n, false));
+
31  const size_t n = routes.size();
+
32  // height of dp array which is 2^n
+
33  const size_t height = 1 << n;
+
34  std::vector<std::vector<bool>> dp(height, std::vector<bool>(n, false));
35 
-
36  // to fill in the [2^i, i] cells with true
-
37  for (size_t i = 0; i < n; ++i) {
-
38  dp[1 << i][i] = true;
-
39  }
-
40  for (size_t i = 1; i < height; i++) {
-
41  std::vector<size_t> zeros, ones;
-
42  // finding positions with 1s and 0s and separate them
-
43  for (size_t pos = 0; pos < n; ++pos) {
-
44  if ((1 << pos) & i) {
-
45  ones.push_back(pos);
-
46  } else {
-
47  zeros.push_back(pos);
-
48  }
-
49  }
+
36  // to fill in the [2^i, i] cells with true
+
37  for (size_t i = 0; i < n; ++i) {
+
38  dp[1 << i][i] = true;
+
39  }
+
40  for (size_t i = 1; i < height; i++) {
+
41  std::vector<size_t> zeros, ones;
+
42  // finding positions with 1s and 0s and separate them
+
43  for (size_t pos = 0; pos < n; ++pos) {
+
44  if ((1 << pos) & i) {
+
45  ones.push_back(pos);
+
46  } else {
+
47  zeros.push_back(pos);
+
48  }
+
49  }
50 
-
51  for (auto &o : ones) {
-
52  if (!dp[i][o]) {
-
53  continue;
-
54  }
+
51  for (auto &o : ones) {
+
52  if (!dp[i][o]) {
+
53  continue;
+
54  }
55 
-
56  for (auto &z : zeros) {
-
57  if (!routes[o][z]) {
-
58  continue;
-
59  }
-
60  dp[i + (1 << z)][z] = true;
-
61  }
-
62  }
-
63  }
+
56  for (auto &z : zeros) {
+
57  if (!routes[o][z]) {
+
58  continue;
+
59  }
+
60  dp[i + (1 << z)][z] = true;
+
61  }
+
62  }
+
63  }
64 
-
65  bool is_cycle = false;
-
66  for (size_t i = 0; i < n; i++) {
-
67  is_cycle |= dp[height - 1][i];
-
68  if (is_cycle) { // if true, all subsequent loop will be true. hence
-
69  // break
-
70  break;
-
71  }
-
72  }
-
73  return is_cycle;
+
65  bool is_cycle = false;
+
66  for (size_t i = 0; i < n; i++) {
+
67  is_cycle |= dp[height - 1][i];
+
68  if (is_cycle) { // if true, all subsequent loop will be true. hence
+
69  // break
+
70  break;
+
71  }
+
72  }
+
73  return is_cycle;
74 }
Here is the call graph for this function:
@@ -243,10 +243,10 @@ Here is the call graph for this function:
142  {
-
143  test1();
-
144  test2();
-
145  test3();
-
146  return 0;
+
143  test1();
+
144  test2();
+
145  test3();
+
146  return 0;
147 }
Here is the call graph for this function:
@@ -281,16 +281,16 @@ Here is the call graph for this function:

this test is testing if hamilton_cycle returns true for graph: 1 -> 2 -> 3 -> 4

Returns
None
81  {
-
82  std::vector<std::vector<bool>> arr{
-
83  std::vector<bool>({true, true, false, false}),
-
84  std::vector<bool>({false, true, true, false}),
-
85  std::vector<bool>({false, false, true, true}),
-
86  std::vector<bool>({false, false, false, true})};
+
82  std::vector<std::vector<bool>> arr{
+
83  std::vector<bool>({true, true, false, false}),
+
84  std::vector<bool>({false, true, true, false}),
+
85  std::vector<bool>({false, false, true, true}),
+
86  std::vector<bool>({false, false, false, true})};
87 
-
88  bool ans = hamilton_cycle(arr);
-
89  std::cout << "Test 1... ";
-
90  assert(ans);
-
91  std::cout << "passed\n";
+
88  bool ans = hamilton_cycle(arr);
+
89  std::cout << "Test 1... ";
+
90  assert(ans);
+
91  std::cout << "passed\n";
92 }
Here is the call graph for this function:
@@ -330,17 +330,17 @@ Here is the call graph for this function:
V 4
Returns
None
103  {
-
104  std::vector<std::vector<bool>> arr{
-
105  std::vector<bool>({true, true, false, false}),
-
106  std::vector<bool>({false, true, true, true}),
-
107  std::vector<bool>({false, false, true, false}),
-
108  std::vector<bool>({false, false, false, true})};
+
104  std::vector<std::vector<bool>> arr{
+
105  std::vector<bool>({true, true, false, false}),
+
106  std::vector<bool>({false, true, true, true}),
+
107  std::vector<bool>({false, false, true, false}),
+
108  std::vector<bool>({false, false, false, true})};
109 
-
110  bool ans = hamilton_cycle(arr);
+
110  bool ans = hamilton_cycle(arr);
111 
-
112  std::cout << "Test 2... ";
-
113  assert(!ans); // not a cycle
-
114  std::cout << "passed\n";
+
112  std::cout << "Test 2... ";
+
113  assert(!ans); // not a cycle
+
114  std::cout << "passed\n";
115 }
Here is the call graph for this function:
@@ -375,17 +375,17 @@ Here is the call graph for this function:

this test is testing if hamilton_cycle returns true for clique with 4 vertices

Returns
None
122  {
-
123  std::vector<std::vector<bool>> arr{
-
124  std::vector<bool>({true, true, true, true}),
-
125  std::vector<bool>({true, true, true, true}),
-
126  std::vector<bool>({true, true, true, true}),
-
127  std::vector<bool>({true, true, true, true})};
+
123  std::vector<std::vector<bool>> arr{
+
124  std::vector<bool>({true, true, true, true}),
+
125  std::vector<bool>({true, true, true, true}),
+
126  std::vector<bool>({true, true, true, true}),
+
127  std::vector<bool>({true, true, true, true})};
128 
-
129  bool ans = hamilton_cycle(arr);
+
129  bool ans = hamilton_cycle(arr);
130 
-
131  std::cout << "Test 3... ";
-
132  assert(ans);
-
133  std::cout << "passed\n";
+
131  std::cout << "Test 3... ";
+
132  assert(ans);
+
133  std::cout << "passed\n";
134 }
Here is the call graph for this function:
diff --git a/df/dce/namespacegraph.html b/df/dce/namespacegraph.html index 004b0b7bf..a3d79216b 100644 --- a/df/dce/namespacegraph.html +++ b/df/dce/namespacegraph.html @@ -400,10 +400,10 @@ Here is the call graph for this function:
-
49  {
+
49  {
50  (*adj)[u - 1].push_back(std::make_pair(v - 1, w));
51  // (*adj)[v - 1].push_back(std::make_pair(u - 1, w));
-
52  }
+
52 }
Here is the call graph for this function:
@@ -584,7 +584,7 @@ Here is the call graph for this function:

first element of pair denotes the distance

for all the reachable vertex from the currently exploring vertex we will try to minimize the distance

minimizing distances

-
66  {
+
66  {
67  /// n denotes the number of vertices in graph
68  int n = adj->size();
69 
@@ -595,7 +595,7 @@ Here is the call graph for this function:
74  /// first element of pair contains the distance
75  /// second element of pair contains the vertex
76  std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>,
-
77  std::greater<std::pair<int, int>>>
+
77  std::greater<std::pair<int, int>>>
78  pq;
79 
80  /// pushing the source vertex 's' with 0 distance in min heap
@@ -605,29 +605,29 @@ Here is the call graph for this function:
84  dist[s] = 0;
85 
86  while (!pq.empty()) {
-
87  /// second element of pair denotes the node / vertex
-
88  int currentNode = pq.top().second;
+
87  /// second element of pair denotes the node / vertex
+
88  int currentNode = pq.top().second;
89 
-
90  /// first element of pair denotes the distance
-
91  int currentDist = pq.top().first;
+
90  /// first element of pair denotes the distance
+
91  int currentDist = pq.top().first;
92 
-
93  pq.pop();
+
93  pq.pop();
94 
-
95  /// for all the reachable vertex from the currently exploring vertex
-
96  /// we will try to minimize the distance
-
97  for (std::pair<int, int> edge : (*adj)[currentNode]) {
-
98  /// minimizing distances
-
99  if (currentDist + edge.second < dist[edge.first]) {
-
100  dist[edge.first] = currentDist + edge.second;
-
101  pq.push(std::make_pair(dist[edge.first], edge.first));
-
102  }
-
103  }
+
95  /// for all the reachable vertex from the currently exploring vertex
+
96  /// we will try to minimize the distance
+
97  for (std::pair<int, int> edge : (*adj)[currentNode]) {
+
98  /// minimizing distances
+
99  if (currentDist + edge.second < dist[edge.first]) {
+
100  dist[edge.first] = currentDist + edge.second;
+
101  pq.push(std::make_pair(dist[edge.first], edge.first));
+
102  }
+
103  }
104  }
105  if (dist[t] != INF) {
-
106  return dist[t];
+
106  return dist[t];
107  }
108  return -1;
-
109  }
+
109 }
Here is the call graph for this function:
diff --git a/navtreedata.js b/navtreedata.js index 1a311e894..6fca4bc26 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -108,12 +108,12 @@ var NAVTREE = var NAVTREEINDEX = [ -"", -"d3/d40/graph__coloring_8cpp.html", -"d5/def/stairs__pattern_8cpp.html", -"d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d", -"db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70", -"dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" +"annotated.html", +"d3/d4c/quick__sort__3_8cpp.html", +"d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002", +"d8/d95/vector__ops_8hpp.html#a5f42063207181529413d812ade52f58e", +"db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e", +"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex0.js b/navtreeindex0.js index 9dfab4d9c..0d526fe9f 100644 --- a/navtreeindex0.js +++ b/navtreeindex0.js @@ -1,10 +1,5 @@ var NAVTREEINDEX0 = { -"":[7,0,3,0], -"":[7,0,4,0], -"":[7,0,6,0], -"":[7,0,6,0,0], -"":[7,0,8,0], "annotated.html":[7,0], "classes.html":[7,1], "d0/d01/smallest__circle_8cpp.html":[8,0,11,11], @@ -249,5 +244,10 @@ var NAVTREEINDEX0 = "d3/d26/binary__search__tree_8cpp.html#ad7a062d9cfb533d97192fd65fad1415c":[8,0,2,2,3], "d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18":[8,0,2,2,6], "d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,2,2,8], -"d3/d26/binary__search__tree_8cpp.html#aebb1a5194a2cd7efe7ee7fc417e78293":[8,0,2,2,12] +"d3/d26/binary__search__tree_8cpp.html#aebb1a5194a2cd7efe7ee7fc417e78293":[8,0,2,2,12], +"d3/d40/graph__coloring_8cpp.html":[8,0,0,0], +"d3/d40/graph__coloring_8cpp.html#a29360ddb1bad75caa61ec895b6e71986":[8,0,0,0,0], +"d3/d40/graph__coloring_8cpp.html#a5a6c3c2b065ea1c07adf2f638f8efc43":[8,0,0,0,1], +"d3/d40/graph__coloring_8cpp.html#a8cfb2d08840766ac4402196079308a36":[8,0,0,0,3], +"d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,0,0,2] }; diff --git a/navtreeindex1.js b/navtreeindex1.js index a7d7dfe5a..68dccbf48 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -1,10 +1,5 @@ var NAVTREEINDEX1 = { -"d3/d40/graph__coloring_8cpp.html":[8,0,0,0], -"d3/d40/graph__coloring_8cpp.html#a29360ddb1bad75caa61ec895b6e71986":[8,0,0,0,0], -"d3/d40/graph__coloring_8cpp.html#a5a6c3c2b065ea1c07adf2f638f8efc43":[8,0,0,0,1], -"d3/d40/graph__coloring_8cpp.html#a8cfb2d08840766ac4402196079308a36":[8,0,0,0,3], -"d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,0,0,2], "d3/d4c/quick__sort__3_8cpp.html":[8,0,15,10], "d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda":[8,0,15,10,4], "d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792":[8,0,15,10,3], @@ -249,5 +244,10 @@ var NAVTREEINDEX1 = "d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[8,0,15,0,4], "d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,0,0], "d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859":[8,0,15,0,2], -"d5/ddb/bogo__sort_8cpp.html#aedfb88e2d6fff1871f038221fe5870fe":[8,0,15,0,3] +"d5/ddb/bogo__sort_8cpp.html#aedfb88e2d6fff1871f038221fe5870fe":[8,0,15,0,3], +"d5/def/stairs__pattern_8cpp.html":[8,0,11,14], +"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,11,14,0], +"d5/df4/merge__sort_8cpp.html":[8,0,15,6], +"d5/df6/check__amicable__pair_8cpp.html":[8,0,9,2], +"d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576":[8,0,9,2,2] }; diff --git a/navtreeindex2.js b/navtreeindex2.js index 7f7cf8b1e..8eae666b6 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,10 +1,5 @@ var NAVTREEINDEX2 = { -"d5/def/stairs__pattern_8cpp.html":[8,0,11,14], -"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,11,14,0], -"d5/df4/merge__sort_8cpp.html":[8,0,15,6], -"d5/df6/check__amicable__pair_8cpp.html":[8,0,9,2], -"d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576":[8,0,9,2,2], "d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[8,0,9,2,3], "d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,9,2,1], "d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01":[8,0,9,2,0], @@ -63,8 +58,8 @@ var NAVTREEINDEX2 = "d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089":[5,2,4], "d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f":[8,0,10,11,5], "d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f":[5,2,5], -"d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812":[5,2,3], "d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812":[8,0,10,10,3], +"d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812":[5,2,3], "d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9":[8,0,10,9,1], "d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9":[5,2,0], "d6/d7a/golden__search__extrema_8cpp.html":[8,0,10,5], @@ -249,5 +244,10 @@ var NAVTREEINDEX2 = "d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,14,1,1], "d8/d95/vector__ops_8hpp.html":[8,0,8,5], "d8/d95/vector__ops_8hpp.html#a05b9445c6ab65053b9bf9897a96af82d":[8,0,8,5,6], -"d8/d95/vector__ops_8hpp.html#a1b42d24ad7bedbfa8e5b59fe96987a44":[8,0,8,5,1] +"d8/d95/vector__ops_8hpp.html#a1b42d24ad7bedbfa8e5b59fe96987a44":[8,0,8,5,1], +"d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d":[8,0,8,5,11], +"d8/d95/vector__ops_8hpp.html#a2a282c162e12f193c58232f26f0fa62d":[8,0,8,5,12], +"d8/d95/vector__ops_8hpp.html#a4d136cbf20e3126ed9b934ab2d03f18b":[8,0,8,5,21], +"d8/d95/vector__ops_8hpp.html#a4dd9a9df9f8f05327bcf7b58b0a86576":[8,0,8,5,15], +"d8/d95/vector__ops_8hpp.html#a5305cc18d11943d3dc0d66e70d7e9c44":[8,0,8,5,17] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index bc4bae702..ee74ecc76 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,10 +1,5 @@ var NAVTREEINDEX3 = { -"d8/d95/vector__ops_8hpp.html#a2055c2f3a076b3d4146aade5eb35666d":[8,0,8,5,11], -"d8/d95/vector__ops_8hpp.html#a2a282c162e12f193c58232f26f0fa62d":[8,0,8,5,12], -"d8/d95/vector__ops_8hpp.html#a4d136cbf20e3126ed9b934ab2d03f18b":[8,0,8,5,21], -"d8/d95/vector__ops_8hpp.html#a4dd9a9df9f8f05327bcf7b58b0a86576":[8,0,8,5,15], -"d8/d95/vector__ops_8hpp.html#a5305cc18d11943d3dc0d66e70d7e9c44":[8,0,8,5,17], "d8/d95/vector__ops_8hpp.html#a5f42063207181529413d812ade52f58e":[8,0,8,5,10], "d8/d95/vector__ops_8hpp.html#a62a418f243cd52b49f59015dddff188e":[8,0,8,5,2], "d8/d95/vector__ops_8hpp.html#a6ef38e5947aef609f908bfbfeaf11d75":[8,0,8,5,4], @@ -115,8 +110,8 @@ var NAVTREEINDEX3 = "d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa":[8,0,8,2,5], "d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f":[5,1,5], "d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f":[8,0,8,1,3], -"d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[5,1,4], "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,0,8,1,1], +"d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[5,1,4], "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,0,8,2,1], "d9/d69/median__search_8cpp.html":[8,0,14,8], "d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae":[8,0,14,8,1], @@ -249,5 +244,10 @@ var NAVTREEINDEX3 = "da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153":[8,0,10,2,6], "da/df2/durand__kerner__roots_8cpp.html#ac38b9cfd2a39d856e0feba3b5d241ded":[8,0,10,2,4], "da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689":[8,0,10,2,0], -"db/d01/brent__method__extrema_8cpp.html":[8,0,10,1] +"db/d01/brent__method__extrema_8cpp.html":[8,0,10,1], +"db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[8,0,10,1,1], +"db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,10,1,5], +"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,10,1,4], +"db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[8,0,10,1,2], +"db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e":[8,0,10,1,0] }; diff --git a/navtreeindex4.js b/navtreeindex4.js index fb6014d98..b40d62453 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -1,10 +1,5 @@ var NAVTREEINDEX4 = { -"db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[8,0,10,1,1], -"db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,10,1,5], -"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,10,1,4], -"db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[8,0,10,1,2], -"db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e":[8,0,10,1,0], "db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[8,0,10,1,6], "db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,10,1,3], "db/d07/spiral__print_8cpp.html":[8,0,11,13], @@ -249,5 +244,10 @@ var NAVTREEINDEX4 = "dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699":[7,0,17,3], "dd/da0/todo.html":[4], "dd/da8/pigeonhole__sort_8cpp.html":[8,0,15,8], -"dd/da8/pigeonhole__sort_8cpp.html#a2f6a7a66934f345f86038a280234e706":[8,0,15,8,1] +"dd/da8/pigeonhole__sort_8cpp.html#a2f6a7a66934f345f86038a280234e706":[8,0,15,8,1], +"dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817":[8,0,15,8,2], +"dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d":[8,0,15,8,3], +"dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,8,0], +"dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a":[8,0,15,8,4], +"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[7,0,4,0,0] }; diff --git a/navtreeindex5.js b/navtreeindex5.js index 366f03d6c..ed0aeda06 100644 --- a/navtreeindex5.js +++ b/navtreeindex5.js @@ -1,10 +1,5 @@ var NAVTREEINDEX5 = { -"dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817":[8,0,15,8,2], -"dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d":[8,0,15,8,3], -"dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,15,8,0], -"dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a":[8,0,15,8,4], -"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[7,0,4,0,0], "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3":[7,0,4,0,0,0], "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca":[7,0,4,0,0,2], "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6":[7,0,4,0,0,5], @@ -88,8 +83,8 @@ var NAVTREEINDEX5 = "df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[8,0,10,15,0], "df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,10,15,2], "df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456":[8,0,10,15,1], -"df/dce/namespacegraph.html":[7,0,4], "df/dce/namespacegraph.html":[6,0,8], +"df/dce/namespacegraph.html":[7,0,4], "df/dd0/queue__using__two__stacks_8cpp.html":[8,0,2,8], "df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863":[8,0,2,8,1], "df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,2,8,0], @@ -129,8 +124,8 @@ var NAVTREEINDEX5 = "dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[8,0,7], "dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[8,0,2,0], "files.html":[8,0], -"functions.html":[7,3,0,0], "functions.html":[7,3,0], +"functions.html":[7,3,0,0], "functions_a.html":[7,3,0,1], "functions_b.html":[7,3,0,2], "functions_c.html":[7,3,0,3], @@ -169,8 +164,8 @@ var NAVTREEINDEX5 = "globals_defs.html":[8,1,4], "globals_e.html":[8,1,0,5], "globals_f.html":[8,1,0,6], -"globals_func.html":[8,1,1], "globals_func.html":[8,1,1,0], +"globals_func.html":[8,1,1], "globals_func_a.html":[8,1,1,1], "globals_func_b.html":[8,1,1,2], "globals_func_c.html":[8,1,1,3], @@ -219,5 +214,10 @@ var NAVTREEINDEX5 = "namespacemembers_func.html":[6,1,1], "namespacemembers_vars.html":[6,1,2], "namespaces.html":[6,0], -"pages.html":[] +"pages.html":[], +"":[7,0,4,0], +"":[7,0,6,0], +"":[7,0,6,0,0], +"":[7,0,3,0], +"":[7,0,8,0] };