123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145 |
- #ifndef BOOST_GRAPH_DAG_SHORTEST_PATHS_HPP
- #define BOOST_GRAPH_DAG_SHORTEST_PATHS_HPP
- #include <boost/graph/topological_sort.hpp>
- #include <boost/graph/dijkstra_shortest_paths.hpp>
- namespace boost
- {
- template < class VertexListGraph, class DijkstraVisitor, class DistanceMap,
- class WeightMap, class ColorMap, class PredecessorMap, class Compare,
- class Combine, class DistInf, class DistZero >
- inline void dag_shortest_paths(const VertexListGraph& g,
- typename graph_traits< VertexListGraph >::vertex_descriptor s,
- DistanceMap distance, WeightMap weight, ColorMap color, PredecessorMap pred,
- DijkstraVisitor vis, Compare compare, Combine combine, DistInf inf,
- DistZero zero)
- {
- typedef typename graph_traits< VertexListGraph >::vertex_descriptor Vertex;
- std::vector< Vertex > rev_topo_order;
- rev_topo_order.reserve(num_vertices(g));
-
-
-
-
-
- topo_sort_visitor< std::back_insert_iterator< std::vector< Vertex > > >
- topo_visitor(std::back_inserter(rev_topo_order));
- depth_first_visit(g, s, topo_visitor, color);
- typename graph_traits< VertexListGraph >::vertex_iterator ui, ui_end;
- for (boost::tie(ui, ui_end) = vertices(g); ui != ui_end; ++ui)
- {
- put(distance, *ui, inf);
- put(pred, *ui, *ui);
- }
- put(distance, s, zero);
- vis.discover_vertex(s, g);
- typename std::vector< Vertex >::reverse_iterator i;
- for (i = rev_topo_order.rbegin(); i != rev_topo_order.rend(); ++i)
- {
- Vertex u = *i;
- vis.examine_vertex(u, g);
- typename graph_traits< VertexListGraph >::out_edge_iterator e, e_end;
- for (boost::tie(e, e_end) = out_edges(u, g); e != e_end; ++e)
- {
- vis.discover_vertex(target(*e, g), g);
- bool decreased
- = relax(*e, g, weight, pred, distance, combine, compare);
- if (decreased)
- vis.edge_relaxed(*e, g);
- else
- vis.edge_not_relaxed(*e, g);
- }
- vis.finish_vertex(u, g);
- }
- }
- namespace detail
- {
-
-
- template < class VertexListGraph, class DijkstraVisitor, class DistanceMap,
- class WeightMap, class ColorMap, class IndexMap, class Params >
- inline void dag_sp_dispatch2(const VertexListGraph& g,
- typename graph_traits< VertexListGraph >::vertex_descriptor s,
- DistanceMap distance, WeightMap weight, ColorMap color, IndexMap /*id*/,
- DijkstraVisitor vis, const Params& params)
- {
- typedef typename property_traits< DistanceMap >::value_type D;
- dummy_property_map p_map;
- D inf = choose_param(get_param(params, distance_inf_t()),
- (std::numeric_limits< D >::max)());
- dag_shortest_paths(g, s, distance, weight, color,
- choose_param(get_param(params, vertex_predecessor), p_map), vis,
- choose_param(
- get_param(params, distance_compare_t()), std::less< D >()),
- choose_param(
- get_param(params, distance_combine_t()), closed_plus< D >(inf)),
- inf, choose_param(get_param(params, distance_zero_t()), D()));
- }
-
- template < class VertexListGraph, class DijkstraVisitor, class DistanceMap,
- class WeightMap, class ColorMap, class IndexMap, class Params >
- inline void dag_sp_dispatch1(const VertexListGraph& g,
- typename graph_traits< VertexListGraph >::vertex_descriptor s,
- DistanceMap distance, WeightMap weight, ColorMap color, IndexMap id,
- DijkstraVisitor vis, const Params& params)
- {
- typedef typename property_traits< WeightMap >::value_type T;
- typename std::vector< T >::size_type n;
- n = is_default_param(distance) ? num_vertices(g) : 1;
- std::vector< T > distance_map(n);
- n = is_default_param(color) ? num_vertices(g) : 1;
- std::vector< default_color_type > color_map(n);
- dag_sp_dispatch2(g, s,
- choose_param(distance,
- make_iterator_property_map(
- distance_map.begin(), id, distance_map[0])),
- weight,
- choose_param(color,
- make_iterator_property_map(
- color_map.begin(), id, color_map[0])),
- id, vis, params);
- }
- }
- template < class VertexListGraph, class Param, class Tag, class Rest >
- inline void dag_shortest_paths(const VertexListGraph& g,
- typename graph_traits< VertexListGraph >::vertex_descriptor s,
- const bgl_named_params< Param, Tag, Rest >& params)
- {
-
- null_visitor null_vis;
- detail::dag_sp_dispatch1(g, s, get_param(params, vertex_distance),
- choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
- get_param(params, vertex_color),
- choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
- choose_param(
- get_param(params, graph_visitor), make_dijkstra_visitor(null_vis)),
- params);
- }
- }
- #endif
|