All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
List of all members
Bfs< GR, TR >::SetStandardProcessedMap Struct Reference

Detailed Description

template<typename GR, typename TR>
struct lemon::Bfs< GR, TR >::SetStandardProcessedMap

Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. If you don't set it explicitly, it will be automatically allocated.

#include <lemon/bfs.h>

+ Inheritance diagram for Bfs< GR, TR >::SetStandardProcessedMap:

Additional Inherited Members

- Public Types inherited from Bfs< Digraph, SetStandardProcessedMapTraits >
typedef
SetStandardProcessedMapTraits::Digraph 
Digraph
 The type of the digraph the algorithm runs on.
 
typedef
SetStandardProcessedMapTraits::PredMap 
PredMap
 The type of the map that stores the predecessor arcs of the shortest paths.
 
typedef
SetStandardProcessedMapTraits::DistMap 
DistMap
 The type of the map that stores the distances of the nodes.
 
typedef
SetStandardProcessedMapTraits::ReachedMap 
ReachedMap
 The type of the map that indicates which nodes are reached.
 
typedef
SetStandardProcessedMapTraits::ProcessedMap 
ProcessedMap
 The type of the map that indicates which nodes are processed.
 
typedef PredMapPath< Digraph,
PredMap
Path
 The type of the paths.
 
typedef
SetStandardProcessedMapTraits 
Traits
 The traits class of the algorithm.
 
- Public Member Functions inherited from Bfs< Digraph, SetStandardProcessedMapTraits >
 Bfs (const Digraph &g)
 Constructor.
 
 ~Bfs ()
 Destructor.
 
BfspredMap (PredMap &m)
 Sets the map that stores the predecessor arcs.
 
BfsreachedMap (ReachedMap &m)
 Sets the map that indicates which nodes are reached.
 
BfsprocessedMap (ProcessedMap &m)
 Sets the map that indicates which nodes are processed.
 
BfsdistMap (DistMap &m)
 Sets the map that stores the distances of the nodes.
 
const PredMappredMap () const
 Returns a const reference to the node map that stores the predecessor arcs.
 
const DistMapdistMap () const
 Returns a const reference to the node map that stores the distances of the nodes.
 
Path path (Node t) const
 The shortest path to the given node.
 
int dist (Node v) const
 The distance of the given node from the root(s).
 
Arc predArc (Node v) const
 Returns the 'previous arc' of the shortest path tree for the given node.
 
Node predNode (Node v) const
 Returns the 'previous node' of the shortest path tree for the given node.
 
bool reached (Node v) const
 Checks if the given node is reached from the root(s).
 
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 NodeBoolMap &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.