| /third_party/boost/boost/graph/ |
| D | dijkstra_shortest_paths_no_color_map.hpp | 29 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map_no_init()
60 vertex_queue.push(start_vertex); in dijkstra_shortest_paths_no_color_map_no_init()
63 visitor.discover_vertex(start_vertex, graph); in dijkstra_shortest_paths_no_color_map_no_init()
134 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_shortest_paths_no_color_map()
155 put(distance_map, start_vertex, distance_zero); in dijkstra_shortest_paths_no_color_map()
158 dijkstra_shortest_paths_no_color_map_no_init(graph, start_vertex, in dijkstra_shortest_paths_no_color_map()
171 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch2()
182 dijkstra_shortest_paths_no_color_map(graph, start_vertex, in dijkstra_no_color_map_dispatch2()
199 typename graph_traits< Graph >::vertex_descriptor start_vertex, in dijkstra_no_color_map_dispatch1()
210 detail::dijkstra_no_color_map_dispatch2(graph, start_vertex, in dijkstra_no_color_map_dispatch1()
[all …]
|
| D | undirected_dfs.hpp | 166 EdgeColorMap edge_color, Vertex start_vertex) in undirected_dfs() argument
184 if (start_vertex != *vertices(g).first) in undirected_dfs()
186 vis.start_vertex(start_vertex, g); in undirected_dfs()
187 detail::undir_dfv_impl(g, start_vertex, vis, vertex_color, edge_color); in undirected_dfs()
195 vis.start_vertex(*ui, g); in undirected_dfs()
216 static void apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
220 undirected_dfs(g, vis, vertex_color, edge_color, start_vertex); in apply()
228 static void apply(const Graph& g, DFSVisitor vis, Vertex start_vertex, in apply()
239 edge_color, start_vertex); in apply()
|
| D | depth_first_search.hpp | 43 vis.start_vertex(u, g); in constraints()
268 typename graph_traits< VertexListGraph >::vertex_descriptor start_vertex) in depth_first_search()
283 if (start_vertex != detail::get_default_starting_vertex(g)) in depth_first_search()
285 vis.start_vertex(start_vertex, g); in depth_first_search()
287 g, start_vertex, vis, color, detail::nontruth2()); in depth_first_search()
296 vis.start_vertex(u, g); in depth_first_search()
327 void start_vertex(Vertex u, const Graph& g) in start_vertex() function in boost::dfs_visitor
416 vis.start_vertex(u, g); in depth_first_visit()
426 vis.start_vertex(u, g); in depth_first_visit()
|
| D | random_spanning_tree.hpp | 125 vertex_descriptor start_vertex = arg_pack[_root_vertex | default_vertex]; in random_spanning_tree() local
138 random_spanning_tree(g, gen, start_vertex, pred_map, e_w_map, c_map); in random_spanning_tree()
|
| D | maximum_adjacency_search.hpp | 60 vis.start_vertex(u, g); in constraints()
82 template < class Vertex, class Graph > void start_vertex(Vertex u, Graph& g) in start_vertex() function in boost::mas_visitor
159 vis.start_vertex(u, g); in maximum_adjacency_search()
|
| D | connected_components.hpp | 43 template < class Vertex, class Graph > void start_vertex(Vertex, Graph&) in start_vertex() function in boost::detail::components_recorder
|
| D | biconnected_components.hpp | 65 void start_vertex(const Vertex& u, Graph& g) in start_vertex() function
68 vis.start_vertex(u, g); in start_vertex()
|
| D | isomorphism.hpp | 208 dfs_visitor.start_vertex(*u, G1); in test_isomorphism()
|
| D | max_cardinality_matching.hpp | 656 template < class Vertex, class Graph > void start_vertex(Vertex, Graph&) in start_vertex() function in boost::detail::odd_components_counter
|
| /third_party/mesa3d/src/gallium/auxiliary/util/ |
| D | u_vbuf.c | 453 int start_vertex, unsigned num_vertices, in u_vbuf_translate_buffers() argument
474 offset = vb->buffer_offset + vb->stride * start_vertex; in u_vbuf_translate_buffers()
571 0 : key->output_stride * start_vertex, in u_vbuf_translate_buffers()
578 out_offset -= key->output_stride * start_vertex; in u_vbuf_translate_buffers()
670 int start_vertex, unsigned num_vertices, in u_vbuf_translate_begin() argument
681 start_vertex, /* VERTEX */ in u_vbuf_translate_begin()
1049 int start_vertex, unsigned num_vertices, in get_upload_offset_size() argument
1079 *offset += vb->stride * start_vertex; in get_upload_offset_size()
1088 int start_vertex, unsigned num_vertices, in u_vbuf_upload_buffers() argument
1105 if (!get_upload_offset_size(mgr, vb, ve, velem, index, i, start_vertex, in u_vbuf_upload_buffers()
[all …]
|
| /third_party/boost/boost/geometry/algorithms/detail/is_valid/ |
| D | complement_graph.hpp | 134 inline bool has_cycles(vertex_handle start_vertex, in has_cycles() argument
138 stack.push(start_vertex); in has_cycles()
|
| /third_party/boost/boost/graph/detail/ |
| D | connected_components.hpp | 42 void start_vertex(Vertex u, Graph& g) in start_vertex() function in boost::detail::components_recorder
45 DFSVisitor::start_vertex(u, g); in start_vertex()
|
| D | self_avoiding_walk.hpp | 184 inline void start_vertex(Vertex v, Graph&) in start_vertex() function in boost::SAW_visitor
|
| /third_party/boost/libs/graph/example/ |
| D | dfs-parenthesis.cpp | 24 void start_vertex(Vertex v, const Graph&) in start_vertex() function
|
| /third_party/mesa3d/src/mesa/main/ |
| D | glthread_draw.c | 111 unsigned start_vertex, unsigned num_vertices, in upload_vertices() argument
159 offset += stride * start_vertex; in upload_vertices()
238 offset += stride * start_vertex; in upload_vertices()
823 unsigned start_vertex = min_index + basevertex; in draw_elements() local
833 !upload_vertices(ctx, user_buffer_mask, start_vertex, num_vertices, in draw_elements()
|
| /third_party/boost/libs/graph_parallel/test/ |
| D | distributed_dfs_test.cpp | 51 void start_vertex(Vertex v, const Graph& g) in start_vertex() function
|
| D | distributed_csr_algorithm_test.cpp | 122 void start_vertex(Vertex v, const Graph& g) in start_vertex() function
|
| /third_party/boost/libs/graph/test/ |
| D | dfs.cpp | 45 template < class Vertex, class Graph > void start_vertex(Vertex u, Graph&) in start_vertex() function in dfs_test_visitor
|
| D | undirected_dfs.cpp | 45 template < class Vertex, class Graph > void start_vertex(Vertex u, Graph&) in start_vertex() function in dfs_test_visitor
|
| D | mas_test.cpp | 91 void start_vertex(vertex_descriptor u, const Graph& g) in start_vertex() function in mas_edge_connectivity_visitor
|
| /third_party/boost/boost/graph/distributed/ |
| D | depth_first_search.hpp | 76 vis.start_vertex(s, g); in run()
|
| /third_party/boost/libs/graph/doc/ |
| D | isomorphism-impl-v2.w | 624 dfs_visitor.start_vertex(*u, G1);
654 void start_vertex(vertex1_t v, const Graph1&) const {
|
| D | isomorphism-impl-v3.w | 679 dfs_visitor.start_vertex(*u, G1);
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | boyer_myrvold_impl.hpp | 55 void start_vertex(const Vertex& u, Graph&) in start_vertex() function
|