Named parameter for setting ReachedMap type. It must conform to the ReadWriteMap concept. 
#include <lemon/bfs.h>
 Inheritance diagram for Bfs< GR, TR >::SetReachedMap< T >:
 Inheritance diagram for Bfs< GR, TR >::SetReachedMap< T >:| Additional Inherited Members | |
|  Public Types inherited from Bfs< Digraph, SetReachedMapTraits< T > > | |
| typedef SetReachedMapTraits< T > ::Digraph | Digraph | 
| The type of the digraph the algorithm runs on. | |
| typedef SetReachedMapTraits< T > ::PredMap | PredMap | 
| The type of the map that stores the predecessor arcs of the shortest paths. | |
| typedef SetReachedMapTraits< T > ::DistMap | DistMap | 
| The type of the map that stores the distances of the nodes. | |
| typedef SetReachedMapTraits< T > ::ReachedMap | ReachedMap | 
| The type of the map that indicates which nodes are reached. | |
| typedef SetReachedMapTraits< T > ::ProcessedMap | ProcessedMap | 
| The type of the map that indicates which nodes are processed. | |
| typedef PredMapPath< Digraph, PredMap > | Path | 
| The type of the paths. | |
| typedef SetReachedMapTraits< T > | Traits | 
| The traits class of the algorithm. | |
|  Public Member Functions inherited from Bfs< Digraph, SetReachedMapTraits< T > > | |
| Bfs (const Digraph &g) | |
| Constructor.  More... | |
| ~Bfs () | |
| Destructor. | |
| Bfs & | predMap (PredMap &m) | 
| Sets the map that stores the predecessor arcs.  More... | |
| Bfs & | reachedMap (ReachedMap &m) | 
| Sets the map that indicates which nodes are reached.  More... | |
| Bfs & | processedMap (ProcessedMap &m) | 
| Sets the map that indicates which nodes are processed.  More... | |
| Bfs & | distMap (DistMap &m) | 
| Sets the map that stores the distances of the nodes.  More... | |
| const PredMap & | predMap () const | 
| Returns a const reference to the node map that stores the predecessor arcs.  More... | |
| const DistMap & | distMap () const | 
| Returns a const reference to the node map that stores the distances of the nodes.  More... | |
| Path | path (Node t) const | 
| The shortest path to the given node.  More... | |
| int | dist (Node v) const | 
| The distance of the given node from the root(s).  More... | |
| Arc | predArc (Node v) const | 
| Returns the 'previous arc' of the shortest path tree for the given node.  More... | |
| Node | predNode (Node v) const | 
| Returns the 'previous node' of the shortest path tree for the given node.  More... | |
| bool | reached (Node v) const | 
| Checks if the given node is reached from the root(s).  More... | |
| void | init () | 
| Initializes the internal data structures.  More... | |
| void | addSource (Node s) | 
| Adds a new source node.  More... | |
| Node | processNextNode () | 
| Processes the next node.  More... | |
| Node | processNextNode (Node target, bool &reach) | 
| Processes the next node.  More... | |
| Node | processNextNode (const NM &nm, Node &rnode) | 
| Processes the next node.  More... | |
| Node | nextNode () const | 
| The next node to be processed.  More... | |
| bool | emptyQueue () const | 
| Returns falseif there are nodes to be processed.  More... | |
| int | queueSize () const | 
| Returns the number of the nodes to be processed.  More... | |
| void | start () | 
| Executes the algorithm.  More... | |
| void | start (Node t) | 
| Executes the algorithm until the given target node is reached.  More... | |
| Node | start (const NodeBoolMap &nm) | 
| Executes the algorithm until a condition is met.  More... | |
| void | run (Node s) | 
| Runs the algorithm from the given source node.  More... | |
| bool | run (Node s, Node t) | 
| Finds the shortest path between sandt.  More... | |
| void | run () | 
| Runs the algorithm to visit all nodes in the digraph.  More... | |
 1.8.5
 1.8.5