| /third_party/boost/boost/graph/ |
| D | undirected_dfs.hpp | 33 DFSVisitor& vis, VertexColorMap vertex_color, EdgeColorMap edge_color) in undir_dfv_impl() argument
59 put(vertex_color, u, Color::gray()); in undir_dfv_impl()
75 ColorValue v_color = get(vertex_color, v); in undir_dfv_impl()
85 put(vertex_color, u, Color::gray()); in undir_dfv_impl()
102 put(vertex_color, u, Color::black()); in undir_dfv_impl()
116 VertexColorMap vertex_color, EdgeColorMap edge_color)
137 put(vertex_color, u, Color::gray());
143 ColorValue v_color = get(vertex_color, v);
149 undir_dfv_impl(g, v, vis, vertex_color, edge_color);
155 put(vertex_color, u, Color::black());
[all …]
|
| D | two_graphs_common_spanning_trees.hpp | 173 std::map< vertex_descriptor, default_color_type > vertex_color; in rec_two_graphs_common_spanning_trees() local
196 vertex_color), in rec_two_graphs_common_spanning_trees()
208 vertex_color), in rec_two_graphs_common_spanning_trees()
254 vertex_color), in rec_two_graphs_common_spanning_trees()
267 vertex_color), in rec_two_graphs_common_spanning_trees()
361 vertex_color), in rec_two_graphs_common_spanning_trees()
372 vertex_color), in rec_two_graphs_common_spanning_trees()
398 vertex_color), in rec_two_graphs_common_spanning_trees()
411 vertex_color), in rec_two_graphs_common_spanning_trees()
454 vertex_color), in rec_two_graphs_common_spanning_trees()
[all …]
|
| D | edmonds_karp_max_flow.hpp | 150 size_type n = is_default_param(get_param(params, vertex_color)) in apply()
184 g, src, sink, pred, params, get_param(params, vertex_color)); in apply()
213 params, get_param(params, vertex_color)); in apply()
|
| D | neighbor_bfs.hpp | 302 ng, s, params, get_param(params, vertex_color)); in neighbor_breadth_first_search()
321 choose_pmap(get_param(params, vertex_color), g, vertex_color)); in neighbor_breadth_first_visit()
|
| D | breadth_first_search.hpp | 340 ng, s, params, get_param(params, vertex_color)); in breadth_first_search()
367 choose_pmap(get_param(params, vertex_color), ng, vertex_color)); in breadth_first_visit()
|
| D | dag_shortest_paths.hpp | 136 get_param(params, vertex_color), in dag_shortest_paths()
|
| /third_party/boost/libs/graph/example/ |
| D | cuthill_mckee_ordering.cpp | 79 cuthill_mckee_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
99 cuthill_mckee_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
120 G, inv_perm.rbegin(), get(vertex_color, G), make_degree_map(G)); in main()
|
| D | king_ordering.cpp | 79 king_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
99 king_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
119 king_ordering(G, inv_perm.rbegin(), get(vertex_color, G), in main()
|
| D | sloan_ordering.cpp | 136 G, s, ecc, get(vertex_color, G), get(vertex_degree, G)); in main()
144 sloan_ordering(G, s, e, sloan_order.begin(), get(vertex_color, G), in main()
190 sloan_ordering(G, sloan_order.begin(), get(vertex_color, G), in main()
|
| D | neighbor_bfs.cpp | 128 d, &p[0], get(vertex_color, G)); in main()
130 G, s, visitor(vis).color_map(get(vertex_color, G))); in main()
|
| D | read_graphviz.cpp | 42 = get(vertex_color, graph); in main()
|
| D | boost_web_graph.cpp | 216 get(vertex_color, g)[*vi] = white_color; in main() local
217 depth_first_visit(search_tree, src, tree_printer, get(vertex_color, g)); in main()
|
| D | dave.cpp | 211 get(vertex_color, G)); in main()
|
| D | parallel-compile-time.cpp | 145 color_map_t color_map = get(vertex_color, g); in main()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_st_connected_test.cpp | 60 get(vertex_color, g), get(vertex_owner, g)); in test_distributed_st_connected()
72 get(vertex_color, g), get(vertex_owner, g)); in test_distributed_st_connected()
|
| D | distributed_dfs_test.cpp | 137 get(vertex_color, g), in test_distributed_dfs()
|
| /third_party/boost/boost/graph/distributed/ |
| D | breadth_first_search.hpp | 109 set_property_map_role(vertex_color, color); in parallel_bfs_helper()
131 set_property_map_role(vertex_color, color); in parallel_bfs_helper()
|
| D | dijkstra_shortest_paths.hpp | 186 = is_default_param(get_param(params, vertex_color)); in dijkstra_shortest_paths()
199 get_param(params, vertex_color), in dijkstra_shortest_paths()
|
| D | st_connected.hpp | 64 set_property_map_role(vertex_color, color); in st_connected()
|
| /third_party/boost/libs/graph/test/ |
| D | cuthill_mckee_ordering.cpp | 79 cuthill_mckee_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
99 cuthill_mckee_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
|
| D | king_ordering.cpp | 79 king_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
99 king_ordering(G, s, inv_perm.rbegin(), get(vertex_color, G), in main()
|
| D | boykov_kolmogorov_max_flow_test.cpp | 127 get(vertex_predecessor, g), get(vertex_color, g), in test_adjacency_list_vecS()
159 get(vertex_predecessor, g), get(vertex_color, g), in test_adjacency_list_listS()
165 boost::default_color_type vertex_color; member
193 get(&tVertex::vertex_predecessor, g), get(&tVertex::vertex_color, g), in test_bundled_properties()
260 get(edge_reverse, g), get(vertex_predecessor, g), get(vertex_color, g), in boykov_kolmogorov_test()
|
| D | graphviz_test.cpp | 60 node_id, g_name, get(vertex_name, g), get(vertex_color, g), in test_graph()
399 vertex_color(get(vertex_index, g)); local
404 vertex_name, vertex_color, edge_weight)));
|
| /third_party/skia/third_party/externals/angle2/src/libANGLE/ |
| D | GLES1Shaders.inc | 1053 vec4 vertex_color;
1057 vertex_color = color_varying_flat;
1061 vertex_color = color_varying;
1064 currentFragment = vertex_color;
1084 vertex_color, texturePrevColor, textureColor);
|
| /third_party/flutter/skia/third_party/externals/angle2/src/libANGLE/ |
| D | GLES1Shaders.inc | 1057 vec4 vertex_color;
1061 vertex_color = color_varying_flat;
1065 vertex_color = color_varying;
1068 currentFragment = vertex_color;
1088 vertex_color, texturePrevColor, textureColor);
|