| /third_party/boost/libs/graph/example/ |
| D | dfs_parenthesis.cpp | 54 E edge_array[] = { E(0, 2), E(1, 1), E(1, 3), E(2, 1), E(2, 3), E(3, 1), in main() local
58 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
59 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
61 Graph G(edge_array, edge_array + sizeof(edge_array) / sizeof(E), 5); in main()
|
| D | city_visitor.cpp | 117 E edge_array[] in main() local
127 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
128 add_edge(edge_array[j].first, edge_array[j].second, G); in main()
130 Graph G(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in main()
|
| D | kruskal-example.cpp | 23 E edge_array[] = { E(0, 2), E(1, 3), E(1, 4), E(2, 1), E(2, 3), E(3, 4), in main() local
26 std::size_t num_edges = sizeof(edge_array) / sizeof(E); in main()
35 = add_edge(edge_array[j].first, edge_array[j].second, g); in main()
39 Graph g(edge_array, edge_array + num_edges, weights, num_nodes); in main()
|
| D | dfs-example.cpp | 60 E edge_array[] = { E(u, v), E(u, x), E(x, v), E(y, x), E(v, y), E(w, y), in main() local
64 for (std::size_t j = 0; j < sizeof(edge_array) / sizeof(E); ++j) in main()
65 add_edge(edge_array[j].first, edge_array[j].second, g); in main()
67 graph_t g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in main()
|
| D | johnson-eg.cpp | 26 Edge edge_array[] = { Edge(0, 1), Edge(0, 2), Edge(0, 3), Edge(0, 4), in main() local
29 const std::size_t E = sizeof(edge_array) / sizeof(Edge); in main()
34 add_edge(edge_array[j].first, edge_array[j].second, g); in main()
36 Graph g(edge_array, edge_array + E, V); in main()
|
| D | bfs-example.cpp | 53 E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t), E(w, x), in main() local
56 const int n_edges = sizeof(edge_array) / sizeof(E); in main()
61 add_edge(edge_array[j].first, edge_array[j].second, g); in main()
64 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
|
| D | adj_list_ra_edgelist.cpp | 23 E edge_array[] = { E(0, 1), E(0, 2), E(0, 1) }; in main() local
24 const std::size_t m = sizeof(edge_array) / sizeof(E); in main()
25 Graph g(edge_array, edge_array + m, n); in main()
|
| D | remove_edge_if_bidir.cpp | 67 Edge edge_array[6] = { Edge(0, 3), Edge(0, 2), Edge(0, 3), Edge(1, 3), in main() local
73 add_edge(edge_array[j].first, edge_array[j].second, g); in main()
75 Graph g(edge_array, edge_array + 6, 4); in main()
|
| D | remove_edge_if_undir.cpp | 66 Edge edge_array[5] in main() local
72 add_edge(edge_array[j].first, edge_array[j].second, g); in main()
74 Graph g(edge_array, edge_array + 5, 4); in main()
|
| D | quick_tour.cpp | 91 Edge edge_array[] = { in main() local
100 const int num_edges = sizeof(edge_array) / sizeof(edge_array[0]); in main()
115 = add_edge(edge_array[j].first, edge_array[j].second, g); in main()
120 edge_array, edge_array + num_edges, transmission_delay, num_vertices); in main()
|
| D | bfs-example2.cpp | 61 E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t), E(w, x), in main() local
64 const int n_edges = sizeof(edge_array) / sizeof(E); in main()
72 add_edge(verts[edge_array[j].first], verts[edge_array[j].second], g); in main()
75 graph_t g(edge_array, edge_array + n_edges, v_size_t(N)); in main()
|
| D | bellman-example.cpp | 62 E edge_array[] = { E(u, y), E(u, x), E(u, v), E(v, u), E(x, y), E(x, v), in main() local
72 add_edge(edge_array[j].first, edge_array[j].second, g); in main()
74 Graph g(edge_array, edge_array + n_edges, N); in main()
|
| D | exterior_property_map.cpp | 82 Pair edge_array[11] = { Pair(0, 1), Pair(0, 2), Pair(0, 3), Pair(0, 4), in main() local
88 add_edge(edge_array[i].first, edge_array[i].second, G); in main()
|
| D | edge_basics.cpp | 68 Pair edge_array[8] = { Pair(0, 1), Pair(0, 2), Pair(0, 3), Pair(0, 4), in main() local
76 add_edge(edge_array[i].first, edge_array[i].second, G); in main()
|
| D | dijkstra-no-color-map-example.cpp | 41 Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), in main() local
44 int num_arcs = sizeof(edge_array) / sizeof(Edge); in main()
45 graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); in main()
|
| D | dijkstra-example.cpp | 37 Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), in main() local
40 int num_arcs = sizeof(edge_array) / sizeof(Edge); in main()
41 graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); in main()
|
| D | interior_pmap_bundled.cpp | 72 Pair edge_array[11] = { Pair(0, 1), Pair(0, 2), Pair(0, 3), Pair(0, 4), in main() local
78 add_edge(edge_array[i].first, edge_array[i].second, G); in main()
|
| D | dijkstra-example-listS.cpp | 40 Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), in main() local
43 int num_arcs = sizeof(edge_array) / sizeof(Edge); in main()
46 graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); in main()
|
| D | interior_property_map.cpp | 89 Pair edge_array[11] = { Pair(0, 1), Pair(0, 2), Pair(0, 3), Pair(0, 4), in main() local
95 add_edge(edge_array[i].first, edge_array[i].second, G); in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_st_connected_test.cpp | 55 E edge_array[] = { E(u, u), E(u, v), E(u, w), E(v, w), E(x, y), in test_distributed_st_connected() local
57 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
67 E edge_array[] = { E(u, v), E(u, w), E(u, x), E(x, v), E(y, x), in test_distributed_st_connected() local
69 Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), N); in test_distributed_st_connected()
|
| D | distributed_page_rank_test.cpp | 59 Edge edge_array[] = in test_distributed_page_rank() local
61 const int num_edges = sizeof(edge_array)/sizeof(edge_array[0]); in test_distributed_page_rank()
64 Graph g(edge_array, edge_array + num_edges, N); in test_distributed_page_rank()
|
| /third_party/boost/libs/graph/test/ |
| D | core_numbers_test.cpp | 83 Edge edge_array[] = { Edge(0, 1), Edge(0, 2), Edge(1, 2) }; in test_2() local
85 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_2()
87 graph_t G(edge_array, edge_array + num_arcs, weights, num_nodes); in test_2()
117 Edge edge_array[] in test_3() local
119 int num_arcs = sizeof(edge_array) / sizeof(Edge); in test_3()
121 graph_t G(edge_array, edge_array + num_arcs, num_nodes); in test_3()
|
| D | sequential_vertex_coloring.cpp | 32 Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), in main() local
34 int m = sizeof(edge_array) / sizeof(Edge); in main()
35 Graph g(edge_array, edge_array + m, n); in main()
|
| D | johnson-test.cpp | 42 Edge edge_array[] = { Edge(0, 1), Edge(1, 2), Edge(2, 3), Edge(1, 4), in main() local
46 const std::size_t E = sizeof(edge_array) / sizeof(Edge); in main()
48 Graph g(edge_array, edge_array + E, V); in main()
|
| D | bellman-test.cpp | 36 Edge edge_array[] = { Edge(B, A) }; in main() local
37 int const numEdges = sizeof(edge_array) / sizeof(Edge); in main()
44 Graph g(edge_array, edge_array + numEdges, numVertex); in main()
|