Home
last modified time | relevance | path

Searched refs:VertexListGraph (Results 1 – 25 of 34) sorted by relevance

12

/third_party/boost/boost/graph/
Dmetric_tsp_approx.hpp86 template < typename VertexListGraph, typename OutputIterator >
87 void metric_tsp_approx_tour(VertexListGraph& g, OutputIterator o) in metric_tsp_approx_tour()
93 template < typename VertexListGraph, typename WeightMap,
95 void metric_tsp_approx_tour(VertexListGraph& g, WeightMap w, OutputIterator o) in metric_tsp_approx_tour()
101 template < typename VertexListGraph, typename OutputIterator >
102 void metric_tsp_approx_tour_from_vertex(VertexListGraph& g, in metric_tsp_approx_tour_from_vertex()
103 typename graph_traits< VertexListGraph >::vertex_descriptor start, in metric_tsp_approx_tour_from_vertex()
110 template < typename VertexListGraph, typename WeightMap,
112 void metric_tsp_approx_tour_from_vertex(VertexListGraph& g, in metric_tsp_approx_tour_from_vertex()
113 typename graph_traits< VertexListGraph >::vertex_descriptor start, in metric_tsp_approx_tour_from_vertex()
[all …]
Dsmallest_last_ordering.hpp36 template < class VertexListGraph, class Order, class Degree, class Marker >
38 const VertexListGraph& G, Order order, Degree degree, Marker marker) in smallest_last_vertex_ordering()
40 typedef typename boost::graph_traits< VertexListGraph > GraphTraits; in smallest_last_vertex_ordering()
48 typename boost::property_map< VertexListGraph, vertex_index_t >::type in smallest_last_vertex_ordering()
58 template < class VertexListGraph, class Order, class Degree, class Marker,
60 void smallest_last_vertex_ordering(const VertexListGraph& G, Order order, in smallest_last_vertex_ordering()
63 typedef typename boost::graph_traits< VertexListGraph > GraphTraits; in smallest_last_vertex_ordering()
125 template < class VertexListGraph, class Order >
126 void smallest_last_vertex_ordering(const VertexListGraph& G, Order order) in smallest_last_vertex_ordering()
128 typedef typename graph_traits< VertexListGraph >::vertex_descriptor in smallest_last_vertex_ordering()
[all …]
Ddag_shortest_paths.hpp22 template < class VertexListGraph, class DijkstraVisitor, class DistanceMap,
25 inline void dag_shortest_paths(const VertexListGraph& g, in dag_shortest_paths()
26 typename graph_traits< VertexListGraph >::vertex_descriptor s, in dag_shortest_paths()
31 typedef typename graph_traits< VertexListGraph >::vertex_descriptor Vertex; in dag_shortest_paths()
44 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end; in dag_shortest_paths()
58 typename graph_traits< VertexListGraph >::out_edge_iterator e, e_end; in dag_shortest_paths()
79 template < class VertexListGraph, class DijkstraVisitor, class DistanceMap,
81 inline void dag_sp_dispatch2(const VertexListGraph& g, in dag_sp_dispatch2()
82 typename graph_traits< VertexListGraph >::vertex_descriptor s, in dag_sp_dispatch2()
100 template < class VertexListGraph, class DijkstraVisitor, class DistanceMap,
[all …]
Dbreadth_first_search.hpp121 template < class VertexListGraph, class SourceIterator, class Buffer,
123 void breadth_first_search(const VertexListGraph& g, in breadth_first_search()
130 typename boost::graph_traits< VertexListGraph >::vertex_iterator i, i_end; in breadth_first_search()
139 template < class VertexListGraph, class Buffer, class BFSVisitor,
141 void breadth_first_search(const VertexListGraph& g, in breadth_first_search()
142 typename graph_traits< VertexListGraph >::vertex_descriptor s, Buffer& Q, in breadth_first_search()
145 typename graph_traits< VertexListGraph >::vertex_descriptor sources[1] in breadth_first_search()
250 template < class VertexListGraph, class ColorMap, class BFSVisitor, class P,
252 void bfs_helper(VertexListGraph& g, in bfs_helper()
253 typename graph_traits< VertexListGraph >::vertex_descriptor s, in bfs_helper()
[all …]
Dastar_search.hpp249 template < typename VertexListGraph, typename AStarHeuristic,
254 inline void astar_search_no_init(const VertexListGraph& g, in astar_search_no_init()
255 typename graph_traits< VertexListGraph >::vertex_descriptor s, in astar_search_no_init()
261 typedef typename graph_traits< VertexListGraph >::vertex_descriptor Vertex; in astar_search_no_init()
289 template < typename VertexListGraph, typename AStarHeuristic,
293 inline void astar_search_no_init_tree(const VertexListGraph& g, in astar_search_no_init_tree()
294 typename graph_traits< VertexListGraph >::vertex_descriptor s, in astar_search_no_init_tree()
300 typedef typename graph_traits< VertexListGraph >::vertex_descriptor Vertex; in astar_search_no_init_tree()
322 BGL_FORALL_OUTEDGES_T(v, e, g, VertexListGraph) in astar_search_no_init_tree()
350 template < typename VertexListGraph, typename AStarHeuristic,
[all …]
Dtranspose_graph.hpp22 template < class VertexListGraph, class MutableGraph >
23 void transpose_graph(const VertexListGraph& G, MutableGraph& G_T) in transpose_graph()
25 reverse_graph< VertexListGraph > R(G); in transpose_graph()
29 template < class VertexListGraph, class MutableGraph, class P, class T,
31 void transpose_graph(const VertexListGraph& G, MutableGraph& G_T, in transpose_graph()
34 reverse_graph< VertexListGraph > Rev(G); in transpose_graph()
Dsequential_vertex_coloring.hpp42 template < class VertexListGraph, class OrderPA, class ColorMap >
44 const VertexListGraph& G, OrderPA order, ColorMap color) in sequential_vertex_coloring()
46 typedef graph_traits< VertexListGraph > GraphTraits; in sequential_vertex_coloring()
101 template < class VertexListGraph, class ColorMap >
103 const VertexListGraph& G, ColorMap color) in sequential_vertex_coloring()
105 typedef typename graph_traits< VertexListGraph >::vertex_descriptor in sequential_vertex_coloring()
107 typedef typename graph_traits< VertexListGraph >::vertex_iterator in sequential_vertex_coloring()
121 graph_traits< VertexListGraph >::null_vertex()), in sequential_vertex_coloring()
Dprim_minimum_spanning_tree.hpp48 template < class VertexListGraph, class DijkstraVisitor, class PredecessorMap,
50 inline void prim_minimum_spanning_tree(const VertexListGraph& g, in prim_minimum_spanning_tree()
51 typename graph_traits< VertexListGraph >::vertex_descriptor s, in prim_minimum_spanning_tree()
62 template < class VertexListGraph, class PredecessorMap, class P, class T,
64 inline void prim_minimum_spanning_tree(const VertexListGraph& g, in prim_minimum_spanning_tree()
73 template < class VertexListGraph, class PredecessorMap >
75 const VertexListGraph& g, PredecessorMap p_map) in prim_minimum_spanning_tree()
Dneighbor_bfs.hpp218 template < class VertexListGraph, class ColorMap, class BFSVisitor, class P,
220 void neighbor_bfs_helper(VertexListGraph& g, in neighbor_bfs_helper()
221 typename graph_traits< VertexListGraph >::vertex_descriptor s, in neighbor_bfs_helper()
225 typedef graph_traits< VertexListGraph > Traits; in neighbor_bfs_helper()
233 typename boost::graph_traits< VertexListGraph >::vertex_iterator i, in neighbor_bfs_helper()
253 template < class VertexListGraph, class P, class T, class R >
254 static void apply(VertexListGraph& g, in apply()
255 typename graph_traits< VertexListGraph >::vertex_descriptor s, in apply()
267 template < class VertexListGraph, class P, class T, class R >
268 static void apply(VertexListGraph& g, in apply()
[all …]
Ddijkstra_shortest_paths.hpp405 template < class VertexListGraph, class SourceInputIter, class DijkstraVisitor,
409 inline void dijkstra_shortest_paths(const VertexListGraph& g, in dijkstra_shortest_paths() argument
414 VertexListGraph, vertex_list_graph_tag)) in dijkstra_shortest_paths()
422 template < class VertexListGraph, class DijkstraVisitor, class PredecessorMap,
426 inline void dijkstra_shortest_paths(const VertexListGraph& g, in dijkstra_shortest_paths() argument
427 typename graph_traits< VertexListGraph >::vertex_descriptor s, in dijkstra_shortest_paths()
432 VertexListGraph, vertex_list_graph_tag)) in dijkstra_shortest_paths()
439 template < class VertexListGraph, class SourceInputIter, class DijkstraVisitor,
443 inline void dijkstra_shortest_paths(const VertexListGraph& g, in dijkstra_shortest_paths()
451 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end; in dijkstra_shortest_paths()
[all …]
Dfloyd_warshall_shortest.hpp51 template < typename VertexListGraph, typename DistanceMatrix,
54 bool floyd_warshall_dispatch(const VertexListGraph& g, DistanceMatrix& d, in floyd_warshall_dispatch()
58 typename graph_traits< VertexListGraph >::vertex_iterator i, lasti, j, in floyd_warshall_dispatch()
76 template < typename VertexListGraph, typename DistanceMatrix,
80 const VertexListGraph& g, DistanceMatrix& d, const BinaryPredicate& compare, in floyd_warshall_initialized_all_pairs_shortest_paths()
83 BOOST_CONCEPT_ASSERT((VertexListGraphConcept< VertexListGraph >)); in floyd_warshall_initialized_all_pairs_shortest_paths()
144 template < class VertexListGraph, class DistanceMatrix, class WeightMap,
146 bool floyd_warshall_init_dispatch(const VertexListGraph& g, in floyd_warshall_init_dispatch()
182 template < class VertexListGraph, class DistanceMatrix, class P, class T,
185 const VertexListGraph& g, DistanceMatrix& d, in floyd_warshall_initialized_all_pairs_shortest_paths()
[all …]
Dcircle_layout.hpp31 template < typename VertexListGraph, typename PositionMap, typename Radius >
33 const VertexListGraph& g, PositionMap position, Radius radius) in circle_graph_layout()
44 typedef typename graph_traits< VertexListGraph >::vertices_size_type in circle_graph_layout()
51 BGL_FORALL_VERTICES_T(v, g, VertexListGraph) in circle_graph_layout()
Dtopological_sort.hpp63 template < typename VertexListGraph, typename OutputIterator, typename P,
65 void topological_sort(VertexListGraph& g, OutputIterator result, in topological_sort()
72 template < typename VertexListGraph, typename OutputIterator >
73 void topological_sort(VertexListGraph& g, OutputIterator result) in topological_sort()
Ddepth_first_search.hpp265 template < class VertexListGraph, class DFSVisitor, class ColorMap >
266 void depth_first_search(const VertexListGraph& g, DFSVisitor vis, in depth_first_search()
268 typename graph_traits< VertexListGraph >::vertex_descriptor start_vertex) in depth_first_search()
270 typedef typename graph_traits< VertexListGraph >::vertex_descriptor Vertex; in depth_first_search()
271 BOOST_CONCEPT_ASSERT((DFSVisitorConcept< DFSVisitor, VertexListGraph >)); in depth_first_search()
275 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end; in depth_first_search()
303 template < class VertexListGraph, class DFSVisitor, class ColorMap >
305 const VertexListGraph& g, DFSVisitor vis, ColorMap color) in depth_first_search()
307 typedef typename boost::graph_traits< VertexListGraph >::vertex_iterator vi; in depth_first_search()
Dedge_connectivity.hpp68 template < class VertexListGraph, class OutputIterator >
69 typename graph_traits< VertexListGraph >::degree_size_type edge_connectivity( in edge_connectivity()
70 VertexListGraph& g, OutputIterator disconnecting_set) in edge_connectivity()
74 typedef graph_traits< VertexListGraph > Traits; in edge_connectivity()
Dincremental_components.hpp92 template < class VertexListGraph, class DisjointSets >
93 void initialize_incremental_components(VertexListGraph& G, DisjointSets& ds) in initialize_incremental_components()
95 typename graph_traits< VertexListGraph >::vertex_iterator v, vend; in initialize_incremental_components()
Dcopy.hpp389 template < typename VertexListGraph, typename MutableGraph >
390 void copy_graph(const VertexListGraph& g_in, MutableGraph& g_out) in copy_graph()
397 typename detail::choose_graph_copy< VertexListGraph >::type copy_impl; in copy_graph()
405 template < typename VertexListGraph, typename MutableGraph, class P, class T,
407 void copy_graph(const VertexListGraph& g_in, MutableGraph& g_out, in copy_graph()
421 typename detail::choose_graph_copy< VertexListGraph >::type copy_impl; in copy_graph()
Dgraph_utility.hpp225 template < class VertexListGraph, class Name >
227 const VertexListGraph& G, Name name, std::ostream& os = std::cout) in print_vertices()
229 typename graph_traits< VertexListGraph >::vertex_iterator vi, vi_end; in print_vertices()
343 template < typename VertexListGraph, typename VertexColorMap >
344 inline bool is_connected(const VertexListGraph& g, VertexColorMap color) in is_connected()
348 typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end, vi, in is_connected()
Dgraph_concepts.hpp176 BOOST_concept(VertexListGraph, (G)) : Graph< G >
182 BOOST_CONCEPT_USAGE(VertexListGraph) in BOOST_CONCEPT_USAGE() argument
269 : VertexListGraph< G >, EdgeListGraph< G > {};
/third_party/boost/libs/graph/example/
Dedge-connectivity.cpp60 template < typename VertexListGraph, typename OutputIterator >
61 typename graph_traits< VertexListGraph >::degree_size_type edge_connectivity( in edge_connectivity()
62 VertexListGraph& g, OutputIterator disconnecting_set) in edge_connectivity()
64 typedef typename graph_traits< VertexListGraph >::vertex_descriptor in edge_connectivity()
66 typedef typename graph_traits< VertexListGraph >::degree_size_type in edge_connectivity()
81 typename graph_traits< VertexListGraph >::vertex_iterator vi, vi_end; in edge_connectivity()
96 typename graph_traits< VertexListGraph >::edge_iterator ei, ei_end; in edge_connectivity()
148 typename graph_traits< VertexListGraph >::out_edge_iterator ei, ei_end; in edge_connectivity()
/third_party/boost/libs/graph/test/
Dmetric_tsp_approx.cpp40 template < typename VertexListGraph, typename PointContainer,
42 void connectAllEuclidean(VertexListGraph& g, const PointContainer& points, in connectAllEuclidean()
49 typedef typename graph_traits< VertexListGraph >::edge_descriptor Edge; in connectAllEuclidean()
50 typedef typename graph_traits< VertexListGraph >::vertex_iterator VItr; in connectAllEuclidean()
/third_party/boost/libs/graph/doc/figs/
Dconcepts.fig40 4 0 0 100 0 19 18 0.0000 4 255 2100 4800 3300 VertexListGraph\001
/third_party/boost/boost/msm/mpl_graph/detail/
Dgraph_implementation_interface.ipp28 // Vertex set for VertexListGraph
/third_party/boost/libs/graph_parallel/doc/
DDistributedVertexListGraph.rst83 .. _Vertex List Graph: http://www.boost.org/libs/graph/doc/VertexListGraph.html
/third_party/boost/libs/graph/doc/
Dwrite_graphml.rst51 IN: ``VertexListGraph& g``
263 .. _VertexListGraph: VertexListGraph.html target in Notes

12