All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
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. More... | |
| ~BfsVisit () | |
| Destructor. | |
| BfsVisit & | reachedMap (ReachedMap &m) |
| Sets the map that indicates which nodes are reached. 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 false if 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 NM &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 s and t. More... | |
| void | run () |
| Runs the algorithm to visit all nodes in the digraph. More... | |
| bool | reached (Node v) const |
| Checks if the given node is reached from the root(s). More... | |
1.8.5
