Home
last modified time | relevance | path

Searched refs:VertexIterator (Results 1 – 18 of 18) sorted by relevance

/third_party/boost/boost/graph/
Dvertex_and_edge_range.hpp21 template < typename Graph, typename VertexIterator, typename EdgeIterator >
36 typedef VertexIterator vertex_iterator;
37 typedef typename std::iterator_traits< VertexIterator >::value_type
56 vertex_and_edge_range(const Graph& g, VertexIterator first_v, in vertex_and_edge_range()
57 VertexIterator last_v, vertices_size_type n, EdgeIterator first_e, in vertex_and_edge_range()
69 vertex_and_edge_range(const Graph& g, VertexIterator first_v, in vertex_and_edge_range()
70 VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) in vertex_and_edge_range()
90 template < typename Graph, typename VertexIterator, typename EdgeIterator >
91 inline std::pair< VertexIterator, VertexIterator > vertices( in vertices() argument
92 const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) in vertices()
[all …]
Deccentricity.hpp49 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in all_eccentricities() typedef
62 VertexIterator i, end; in all_eccentricities()
84 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in radius_and_diameter() typedef
92 VertexIterator i, end; in radius_and_diameter()
Dclustering_coefficient.hpp124 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in all_clustering_coefficients() typedef
129 VertexIterator i, end; in all_clustering_coefficients()
145 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in mean_clustering_coefficient() typedef
150 VertexIterator i, end; in mean_clustering_coefficient()
Dedge_connectivity.hpp57 template < class Graph, class VertexIterator, class OutputIterator >
58 void neighbors(const Graph& g, VertexIterator first, VertexIterator last, in neighbors()
Ddegree_centrality.hpp99 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in all_degree_centralities() typedef
103 VertexIterator i, end; in all_degree_centralities()
Dbron_kerbosch_all_cliques.hpp277 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in bron_kerbosch_all_cliques() typedef
285 VertexIterator i, end; in bron_kerbosch_all_cliques()
Dgeodesic_distance.hpp140 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in all_mean_geodesics() typedef
156 VertexIterator i, end; in all_mean_geodesics()
Dtiernan_all_cycles.hpp321 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in tiernan_all_cycles() typedef
323 VertexIterator i, end; in tiernan_all_cycles()
Dhawick_circuits.hpp300 typedef typename Traits::vertex_iterator VertexIterator; in call_hawick_circuits() typedef
314 VertexIterator start, last; in call_hawick_circuits()
Dtransitive_reduction.hpp49 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in transitive_reduction() typedef
Dsubgraph.hpp189 template < typename VertexIterator >
191 VertexIterator first, VertexIterator last) in create_subgraph()
/third_party/boost/boost/graph/detail/
Dadj_list_edge_iterator.hpp35 template < class VertexIterator, class OutEdgeIterator, class Graph >
61 VertexIterator b, VertexIterator c, VertexIterator e, const G& g) in adj_list_edge_iterator()
117 VertexIterator vBegin;
118 VertexIterator vCurr;
119 VertexIterator vEnd;
Dgeodesic.hpp53 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in combine_distances() typedef
66 VertexIterator i, end; in combine_distances()
/third_party/boost/libs/graph/test/
Dtest_graph.hpp126 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in test_graph() typedef
128 std::pair< VertexIterator, VertexIterator > rng = vertices(g); in test_graph()
Dbundled_properties.cpp109 template < typename Map, typename VertexIterator, typename Bundle >
111 Map& map, VertexIterator, const Bundle& bundle, truth< true >) in do_add_vertex() argument
116 template < typename Map, typename VertexIterator, typename Bundle >
118 Map& map, VertexIterator& vi, const Bundle& bundle, truth< false >) in do_add_vertex()
Dadj_list_invalidation.cpp69 typedef typename graph_traits< Graph >::vertex_iterator VertexIterator; in invalidate_vertices() typedef
75 VertexIterator i = vertices(g).first; in invalidate_vertices()
/third_party/boost/libs/graph/example/
Dedge-connectivity.cpp52 template < typename Graph, typename VertexIterator, typename OutputIterator >
53 void neighbors(const Graph& g, VertexIterator first, VertexIterator last, in neighbors()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
DGraph.h266 using VertexIterator = typename VertexMapT::iterator; variable
276 VertexIterator>::type;
447 std::pair<VertexIterator, bool>
452 std::pair<VertexIterator, bool>