Searched refs:EdgeListGraph (Results 1 – 13 of 13) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | bellman_ford_shortest_paths.hpp | 90 template < class EdgeListGraph, class Size, class WeightMap,
93 bool bellman_ford_shortest_paths(EdgeListGraph& g, Size N, WeightMap weight, in bellman_ford_shortest_paths()
97 BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< EdgeListGraph >)); in bellman_ford_shortest_paths()
98 typedef graph_traits< EdgeListGraph > GTraits; in bellman_ford_shortest_paths()
184 template < class EdgeListGraph, class Size, class WeightMap,
186 bool bellman_dispatch(EdgeListGraph& g, Size N, WeightMap weight, in bellman_dispatch()
197 template < class EdgeListGraph, class Size, class P, class T, class R >
199 EdgeListGraph& g, Size N, const bgl_named_params< P, T, R >& params) in bellman_ford_shortest_paths()
207 template < class EdgeListGraph, class Size >
208 bool bellman_ford_shortest_paths(EdgeListGraph& g, Size N) in bellman_ford_shortest_paths()
|
| D | incremental_components.hpp | 55 template < class EdgeListGraph, class DisjointSets >
56 void incremental_components(EdgeListGraph& g, DisjointSets& ds) in incremental_components()
58 typename graph_traits< EdgeListGraph >::edge_iterator e, end; in incremental_components()
|
| D | graph_utility.hpp | 203 template < class EdgeListGraph, class Name >
205 const EdgeListGraph& G, Name name, std::ostream& os = std::cout) in print_edges()
207 typename graph_traits< EdgeListGraph >::edge_iterator ei, ei_end; in print_edges()
214 template < class EdgeListGraph, class VertexName, class EdgeName >
215 void print_edges2(const EdgeListGraph& G, VertexName vname, EdgeName ename, in print_edges2()
218 typename graph_traits< EdgeListGraph >::edge_iterator ei, ei_end; in print_edges2()
|
| D | graph_concepts.hpp | 226 BOOST_concept(EdgeListGraph, (G)) : Graph< G >
233 BOOST_CONCEPT_USAGE(EdgeListGraph) in BOOST_CONCEPT_USAGE() argument
269 : VertexListGraph< G >, EdgeListGraph< G > {};
|
| /third_party/boost/libs/graph/doc/figs/ |
| D | concepts.fig | 39 4 0 0 100 0 19 18 0.0000 4 255 1935 4575 3975 EdgeListGraph\001
|
| /third_party/boost/boost/msm/mpl_graph/detail/ |
| D | graph_implementation_interface.ipp | 32 // Edge set for EdgeListGraph
|
| D | incidence_list_graph.ipp | 94 // Edge set for EdgeListGraph
|
| D | adjacency_list_graph.ipp | 114 // Edge set for EdgeListGraph
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | DistributedEdgeListGraph.rst | 83 .. _Edge List Graph: http://www.boost.org/libs/graph/doc/EdgeListGraph.html
|
| D | distributed_adjacency_list.rst | 955 .. _Edge List Graph: http://www.boost.org/libs/graph/doc/EdgeListGraph.html
|
| /third_party/boost/libs/graph/doc/ |
| D | isomorphism-impl-v3.w | 483 here, but that would introduce the \bglconcept{EdgeListGraph}
982 % LocalWords: iterators VertexListGraph EdgeListGraph BidirectionalGraph tmp
|
| D | isomorphism-impl.w | 292 \bglconcept{EdgeListGraph}. The \code{Graph2} type must be a
1201 % LocalWords: iterators VertexListGraph EdgeListGraph BidirectionalGraph tmp
|
| D | isomorphism-impl-v2.w | 1062 % LocalWords: iterators VertexListGraph EdgeListGraph BidirectionalGraph tmp
|