| /third_party/boost/boost/graph/ |
| D | dijkstra_shortest_paths_no_color_map.hpp | 28 void dijkstra_shortest_paths_no_color_map_no_init(const Graph& graph, in dijkstra_shortest_paths_no_color_map_no_init()
133 void dijkstra_shortest_paths_no_color_map(const Graph& graph, in dijkstra_shortest_paths_no_color_map()
170 inline void dijkstra_no_color_map_dispatch2(const Graph& graph, in dijkstra_no_color_map_dispatch2()
198 inline void dijkstra_no_color_map_dispatch1(const Graph& graph, in dijkstra_no_color_map_dispatch1()
220 inline void dijkstra_shortest_paths_no_color_map(const Graph& graph, in dijkstra_shortest_paths_no_color_map()
|
| 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 | random_spanning_tree.hpp | 125 vertex_descriptor start_vertex = arg_pack[_root_vertex | default_vertex]; in random_spanning_tree() local
|
| D | depth_first_search.hpp | 266 void depth_first_search(const VertexListGraph& g, DFSVisitor vis, in depth_first_search()
327 void start_vertex(Vertex u, const Graph& g) in start_vertex() function in boost::dfs_visitor
|
| D | undirected_dfs.hpp | 166 EdgeColorMap edge_color, Vertex start_vertex) in undirected_dfs()
|
| D | maximum_adjacency_search.hpp | 82 template < class Vertex, class Graph > void start_vertex(Vertex u, Graph& g) in start_vertex() function in boost::mas_visitor
|
| D | biconnected_components.hpp | 65 void start_vertex(const Vertex& u, Graph& g) in start_vertex() function
|
| 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/boost/libs/graph/example/ |
| D | dfs-parenthesis.cpp | 24 void start_vertex(Vertex v, const Graph&) in start_vertex() function
|
| /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/mesa3d/src/gallium/auxiliary/util/ |
| D | u_vbuf.c | 453 int start_vertex, unsigned num_vertices, in u_vbuf_translate_buffers()
670 int start_vertex, unsigned num_vertices, in u_vbuf_translate_begin()
1049 int start_vertex, unsigned num_vertices, in get_upload_offset_size()
1088 int start_vertex, unsigned num_vertices, in u_vbuf_upload_buffers()
1387 int start_vertex; in u_vbuf_draw_vbo() local
|
| /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()
|
| /third_party/boost/libs/graph/test/ |
| D | mas_test.cpp | 91 void start_vertex(vertex_descriptor u, const Graph& g) in start_vertex() function in mas_edge_connectivity_visitor
|
| 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
|
| /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
|
| D | self_avoiding_walk.hpp | 184 inline void start_vertex(Vertex v, Graph&) in start_vertex() function in boost::SAW_visitor
|
| /third_party/mesa3d/src/mesa/main/ |
| D | glthread_draw.c | 111 unsigned start_vertex, unsigned num_vertices, in upload_vertices()
823 unsigned start_vertex = min_index + basevertex; in draw_elements() local
|
| /third_party/boost/boost/graph/planar_detail/ |
| D | boyer_myrvold_impl.hpp | 55 void start_vertex(const Vertex& u, Graph&) in start_vertex() function
|