boost::bellman_visitor< Visitors > Class Template Reference

#include <bellman_ford_shortest_paths.hpp>

Inheritance diagram for boost::bellman_visitor< Visitors >:

Collaboration diagram for boost::bellman_visitor< Visitors >:

Public Member Functions
	bellman_visitor ()
	bellman_visitor (Visitors vis)
template<class Edge , class Graph >
void	examine_edge (Edge u, Graph &g)
template<class Edge , class Graph >
void	edge_relaxed (Edge u, Graph &g)
template<class Edge , class Graph >
void	edge_not_relaxed (Edge u, Graph &g)
template<class Edge , class Graph >
void	edge_minimized (Edge u, Graph &g)
template<class Edge , class Graph >
void	edge_not_minimized (Edge u, Graph &g)

Protected Attributes
Visitors	m_vis

Constructor & Destructor Documentation

template<class Visitors = null_visitor>

boost::bellman_visitor< Visitors >::bellman_visitor ( )

inline

template<class Visitors = null_visitor>

boost::bellman_visitor< Visitors >::bellman_visitor ( Visitors  vis )

inline

Member Function Documentation

template<class Visitors = null_visitor>

template<class Edge , class Graph >

void boost::bellman_visitor< Visitors >::edge_minimized ( Edge  u, Graph &  g  )

inline

template<class Visitors = null_visitor>

template<class Edge , class Graph >

void boost::bellman_visitor< Visitors >::edge_not_minimized ( Edge  u, Graph &  g  )

inline

template<class Visitors = null_visitor>

template<class Edge , class Graph >

void boost::bellman_visitor< Visitors >::edge_not_relaxed ( Edge  u, Graph &  g  )

inline

template<class Visitors = null_visitor>

template<class Edge , class Graph >

void boost::bellman_visitor< Visitors >::edge_relaxed ( Edge  u, Graph &  g  )

inline

template<class Visitors = null_visitor>

template<class Edge , class Graph >

void boost::bellman_visitor< Visitors >::examine_edge ( Edge  u, Graph &  g  )

inline

Member Data Documentation

template<class Visitors = null_visitor>

Visitors boost::bellman_visitor< Visitors >::m_vis

protected

Referenced by boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_minimized(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_not_minimized(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_not_relaxed(), boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::edge_relaxed(), and boost::bellman_visitor< edge_predecessor_recorder< PredEdgeMap, on_edge_relaxed > >::examine_edge().

---

The documentation for this class was generated from the following file:

• boost_1_57_0/boost/graph/bellman_ford_shortest_paths.hpp