BfsVisit< GR, VS, TR >::SetReachedMap< T > Struct Template Reference

Detailed Description

template<typename GR, typename VS, typename TR>
template<class T>
struct lemon::BfsVisit< GR, VS, TR >::SetReachedMap< T >

Named parameter for setting ReachedMap type.

#include <lemon/bfs.h>

Inheritance diagram for BfsVisit< GR, VS, TR >::SetReachedMap< T >:

Additional Inherited Members
Public Types inherited from BfsVisit< Digraph, Visitor, SetReachedMapTraits< T > >
typedef SetReachedMapTraits< T >	Traits
	The traits class.
typedef Traits::Digraph	Digraph
	The type of the digraph the algorithm runs on.
typedef Visitor	Visitor
	The visitor type used by the algorithm.
typedef Traits::ReachedMap	ReachedMap
	The type of the map that indicates which nodes are reached.
Public Member Functions inherited from BfsVisit< Digraph, Visitor, SetReachedMapTraits< T > >
	BfsVisit (const Digraph &digraph, Visitor &visitor)
	Constructor.
	~BfsVisit ()
	Destructor.
BfsVisit &	reachedMap (ReachedMap &m)
	Sets the map that indicates which nodes are reached.
void	init ()
void	addSource (Node s)
	Adds a new source node.
Node	processNextNode ()
	Processes the next node.
Node	processNextNode (Node target, bool &reach)
	Processes the next node.
Node	processNextNode (const NM &nm, Node &rnode)
	Processes the next node.
Node	nextNode () const
	The next node to be processed.
bool	emptyQueue () const
	Returns false if there are nodes to be processed.
int	queueSize () const
	Returns the number of the nodes to be processed.
void	start ()
	Executes the algorithm.
void	start (Node t)
	Executes the algorithm until the given target node is reached.
Node	start (const NM &nm)
	Executes the algorithm until a condition is met.
void	run (Node s)
	Runs the algorithm from the given source node.
bool	run (Node s, Node t)
	Finds the shortest path between s and t.
void	run ()
	Runs the algorithm to visit all nodes in the digraph.
bool	reached (Node v) const
	Checks if a node is reached from the root(s).