All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Named parameter for setting DistMap type. It must meet the WriteMap concept.
#include <lemon/bfs.h>
Inheritance diagram for Bfs< GR, TR >::SetDistMap< T >:Additional Inherited Members | |
| Public Types inherited from Bfs< Digraph, SetDistMapTraits< T > > | |
|
typedef SetDistMapTraits< T > ::Digraph | Digraph |
| The type of the digraph the algorithm runs on. | |
|
typedef SetDistMapTraits< T > ::PredMap | PredMap |
| The type of the map that stores the predecessor arcs of the shortest paths. | |
|
typedef SetDistMapTraits< T > ::DistMap | DistMap |
| The type of the map that stores the distances of the nodes. | |
|
typedef SetDistMapTraits< T > ::ReachedMap | ReachedMap |
| The type of the map that indicates which nodes are reached. | |
|
typedef SetDistMapTraits< 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 SetDistMapTraits< T > | Traits |
| The traits class of the algorithm. | |
| Public Member Functions inherited from Bfs< Digraph, SetDistMapTraits< T > > | |
| Bfs (const Digraph &g) | |
| Constructor. | |
| ~Bfs () | |
| Destructor. | |
| Bfs & | predMap (PredMap &m) |
| Sets the map that stores the predecessor arcs. | |
| Bfs & | reachedMap (ReachedMap &m) |
| Sets the map that indicates which nodes are reached. | |
| Bfs & | processedMap (ProcessedMap &m) |
| Sets the map that indicates which nodes are processed. | |
| Bfs & | distMap (DistMap &m) |
| Sets the map that stores the distances of the nodes. | |
| const PredMap & | predMap () const |
| Returns a const reference to the node map that stores the predecessor arcs. | |
| const DistMap & | distMap () 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 a node. | |
| int | dist (Node v) const |
| The distance of a node from the root(s). | |
| Arc | predArc (Node v) const |
| Returns the 'previous arc' of the shortest path tree for a node. | |
| Node | predNode (Node v) const |
| Returns the 'previous node' of the shortest path tree for a node. | |
| bool | reached (Node v) const |
| Checks if a 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. | |
1.8.2
