dijkstra_shortest_paths.hpp File Reference

#include <functional>
#include <boost/limits.hpp>
#include <boost/graph/named_function_params.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/relax.hpp>
#include <boost/pending/indirect_cmp.hpp>
#include <boost/graph/exception.hpp>
#include <boost/pending/relaxed_heap.hpp>
#include <boost/graph/overloading.hpp>
#include <boost/smart_ptr.hpp>
#include <boost/graph/detail/d_ary_heap.hpp>
#include <boost/graph/two_bit_color_map.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/property_map/vector_property_map.hpp>
#include <boost/type_traits.hpp>
#include <boost/concept/assert.hpp>

Include dependency graph for dijkstra_shortest_paths.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	boost::DijkstraVisitorConcept< Visitor, Graph >
class	boost::dijkstra_visitor< Visitors >
struct	boost::detail::dijkstra_bfs_visitor< UniformCostVisitor, UpdatableQueue, WeightMap, PredecessorMap, DistanceMap, BinaryFunction, BinaryPredicate >
struct	boost::detail::vertex_property_map_generator_helper< Graph, IndexMap, Value, KnownNumVertices >
struct	boost::detail::vertex_property_map_generator_helper< Graph, IndexMap, Value, true >
struct	boost::detail::vertex_property_map_generator_helper< Graph, IndexMap, Value, false >
struct	boost::detail::vertex_property_map_generator< Graph, IndexMap, Value >
struct	boost::detail::default_color_map_generator_helper< Graph, IndexMap, KnownNumVertices >
struct	boost::detail::default_color_map_generator_helper< Graph, IndexMap, true >
struct	boost::detail::default_color_map_generator_helper< Graph, IndexMap, false >
struct	boost::detail::default_color_map_generator< Graph, IndexMap >

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Typedefs
typedef dijkstra_visitor	boost::default_dijkstra_visitor

Functions
template<typename Buffer , typename Vertex , typename DistanceType >
void	boost::dijkstra_queue_update (Buffer &Q, Vertex vertex, DistanceType old_distance)
	Updates a particular value in a queue used by Dijkstra's algorithm. More...
template<class Visitors >
dijkstra_visitor< Visitors >	boost::make_dijkstra_visitor (Visitors vis)
template<class Graph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero >
void	boost::dijkstra_shortest_paths_no_init (const Graph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis)
template<class Graph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero >
void	boost::dijkstra_shortest_paths_no_init (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis)
template<class Graph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero , class ColorMap >
void	boost::dijkstra_shortest_paths_no_init (const Graph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class Graph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistZero , class ColorMap >
void	boost::dijkstra_shortest_paths_no_init (const Graph &g, typename graph_traits< Graph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , typename T , typename Tag , typename Base >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, const bgl_named_params< T, Tag, Base > &BOOST_GRAPH_ENABLE_IF_MODELS_PARM(VertexListGraph, vertex_list_graph_tag))
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , typename T , typename Tag , typename Base >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, const bgl_named_params< T, Tag, Base > &BOOST_GRAPH_ENABLE_IF_MODELS_PARM(VertexListGraph, vertex_list_graph_tag))
template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , class ColorMap >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero , class ColorMap >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis, ColorMap color)
template<class VertexListGraph , class SourceInputIter , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, SourceInputIter s_begin, SourceInputIter s_end, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis)
template<class VertexListGraph , class DijkstraVisitor , class PredecessorMap , class DistanceMap , class WeightMap , class IndexMap , class Compare , class Combine , class DistInf , class DistZero >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, IndexMap index_map, Compare compare, Combine combine, DistInf inf, DistZero zero, DijkstraVisitor vis)
template<class VertexListGraph , class DistanceMap , class WeightMap , class IndexMap , class Params >
void	boost::detail::dijkstra_dispatch2 (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, IndexMap index_map, const Params &params)
template<class VertexListGraph , class DistanceMap , class WeightMap , class IndexMap , class Params >
void	boost::detail::dijkstra_dispatch1 (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, DistanceMap distance, WeightMap weight, IndexMap index_map, const Params &params)
template<class VertexListGraph , class Param , class Tag , class Rest >
void	boost::dijkstra_shortest_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, const bgl_named_params< Param, Tag, Rest > &params)