Searched refs:ordered_vertices (Results 1 – 4 of 4) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | betweenness_centrality.hpp | 52 std::stack< vertex_descriptor >& ordered_vertices, in brandes_dijkstra_visitor()
55 : ordered_vertices(ordered_vertices) in brandes_dijkstra_visitor()
103 ordered_vertices.push(w); in examine_vertex()
107 std::stack< vertex_descriptor >& ordered_vertices; member
175 std::stack< vertex_descriptor >& ordered_vertices) in visitor_type()
179 , ordered_vertices(ordered_vertices) in visitor_type()
186 ordered_vertices.push(v); in examine_vertex()
226 std::stack< vertex_descriptor >& ordered_vertices; member
332 std::stack< vertex_descriptor > ordered_vertices; in brandes_betweenness_centrality_impl() local
349 shortest_paths(g, *s, ordered_vertices, incoming, distance, in brandes_betweenness_centrality_impl()
[all …]
|
| D | graphml.hpp | 256 bool ordered_vertices = false) in write_graphml() argument
314 << " parse.nodeids=\"" << (ordered_vertices ? "canonical" : "free") in write_graphml()
380 const dynamic_properties& dp, bool ordered_vertices = false) in write_graphml() argument
382 write_graphml(out, g, get(vertex_index, g), dp, ordered_vertices); in write_graphml()
|
| /third_party/boost/libs/graph/doc/ |
| D | write_graphml.rst | 24 bool ordered_vertices=false);
29 const dynamic_properties& dp, bool ordered_vertices=false);
66 IN: ``bool ordered_vertices``
|
| /third_party/boost/boost/graph/distributed/ |
| D | betweenness_centrality.hpp | 1052 Stack& ordered_vertices, in do_sequential_brandes_sssp() argument
1072 shortest_paths(g, v, ordered_vertices, incoming, distance, in do_sequential_brandes_sssp()
1075 while (!ordered_vertices.empty()) { in do_sequential_brandes_sssp()
1076 vertex_descriptor w = ordered_vertices.top(); in do_sequential_brandes_sssp()
1077 ordered_vertices.pop(); in do_sequential_brandes_sssp()
1138 std::stack<vertex_descriptor> ordered_vertices; in non_distributed_brandes_betweenness_centrality_impl() local
1154 shortest_paths, ordered_vertices, local_sources[i]); in non_distributed_brandes_betweenness_centrality_impl()
1165 shortest_paths, ordered_vertices, v); in non_distributed_brandes_betweenness_centrality_impl()
|