Boost  v1.57.0
doxygen for www.boost.org
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
bellman_ford_shortest_paths.hpp File Reference
Include dependency graph for bellman_ford_shortest_paths.hpp:
This graph shows which files directly or indirectly include this file:

Classes

struct  boost::BellmanFordVisitorConcept< Visitor, Graph >
 
class  boost::bellman_visitor< Visitors >
 

Namespaces

 boost
 Duration formatting facet for input.
 
 boost::detail
 

Typedefs

typedef bellman_visitor boost::default_bellman_visitor
 

Functions

template<class Visitors >
bellman_visitor< Visitors > boost::make_bellman_visitor (Visitors vis)
 
template<class EdgeListGraph , class Size , class WeightMap , class PredecessorMap , class DistanceMap , class BinaryFunction , class BinaryPredicate , class BellmanFordVisitor >
bool boost::bellman_ford_shortest_paths (EdgeListGraph &g, Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, BinaryFunction combine, BinaryPredicate compare, BellmanFordVisitor v)
 
template<typename VertexAndEdgeListGraph , typename Size , typename WeightMap , typename PredecessorMap , typename DistanceMap , typename P , typename T , typename R >
bool boost::detail::bellman_dispatch2 (VertexAndEdgeListGraph &g, typename graph_traits< VertexAndEdgeListGraph >::vertex_descriptor s, Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, const bgl_named_params< P, T, R > &params)
 
template<typename VertexAndEdgeListGraph , typename Size , typename WeightMap , typename PredecessorMap , typename DistanceMap , typename P , typename T , typename R >
bool boost::detail::bellman_dispatch2 (VertexAndEdgeListGraph &g, param_not_found, Size N, WeightMap weight, PredecessorMap pred, DistanceMap distance, const bgl_named_params< P, T, R > &params)
 
template<class EdgeListGraph , class Size , class WeightMap , class DistanceMap , class P , class T , class R >
bool boost::detail::bellman_dispatch (EdgeListGraph &g, Size N, WeightMap weight, DistanceMap distance, const bgl_named_params< P, T, R > &params)
 
template<class EdgeListGraph , class Size , class P , class T , class R >
bool boost::bellman_ford_shortest_paths (EdgeListGraph &g, Size N, const bgl_named_params< P, T, R > &params)
 
template<class EdgeListGraph , class Size >
bool boost::bellman_ford_shortest_paths (EdgeListGraph &g, Size N)
 
template<class VertexAndEdgeListGraph , class P , class T , class R >
bool boost::bellman_ford_shortest_paths (VertexAndEdgeListGraph &g, const bgl_named_params< P, T, R > &params)