|
Public Types |
typedef TR::Graph | Graph |
| The type of the underlying graph.
|
typedef Graph::Node | Node |
|
|
typedef Graph::NodeIt | NodeIt |
|
|
typedef Graph::Edge | Edge |
|
|
typedef Graph::OutEdgeIt | OutEdgeIt |
|
|
typedef TR::PredMap | PredMap |
| The type of the map that stores the last edges of the shortest paths.
|
typedef TR::ReachedMap | ReachedMap |
| The type of the map indicating which nodes are reached.
|
typedef TR::ProcessedMap | ProcessedMap |
| The type of the map indicating which nodes are processed.
|
typedef TR::DistMap | DistMap |
| The type of the map that stores the dists of the nodes.
|
Public Member Functions |
| Bfs (const Graph &_G) |
| Constructor.
|
| ~Bfs () |
| Destructor.
|
Bfs & | predMap (PredMap &m) |
| Sets the map storing the predecessor edges.
|
Bfs & | reachedMap (ReachedMap &m) |
| Sets the map indicating the reached nodes.
|
Bfs & | processedMap (ProcessedMap &m) |
| Sets the map indicating the processed nodes.
|
Bfs & | distMap (DistMap &m) |
| Sets the map storing the distances calculated by the algorithm.
|
|
The simplest way to execute the algorithm is to use one of the member functions called run (...).
If you need more control on the execution, first you must call init(), then you can add several source nodes with addSource(). Finally start() will perform the actual path computation.
|
void | init () |
| Initializes the internal data structures.
|
void | addSource (Node s) |
| Adds a new source node.
|
Node | processNextNode () |
| Processes the next node.
|
bool | emptyQueue () |
| Returns false if there are nodes to be processed in the queue.
|
int | queueSize () |
| Returns the number of the nodes to be processed.
|
void | start () |
| Executes the algorithm.
|
void | start (Node dest) |
| Executes the algorithm until dest is reached.
|
template<class NM> |
void | start (const NM &nm) |
| Executes the algorithm until a condition is met.
|
void | run (Node s) |
| Runs BFS algorithm from node s .
|
int | run (Node s, Node t) |
| Finds the shortest path between s and t .
|
|
The result of the BFS algorithm can be obtained using these functions.
Before the use of these functions, either run() or start() must be called.
|
template<class P> |
bool | getPath (P &p, Node t) |
| Copies the shortest path to t into p .
|
int | dist (Node v) const |
| The distance of a node from the root(s).
|
Edge | pred (Node v) const |
| Returns the 'previous edge' of the shortest path tree.
|
Node | predNode (Node v) const |
| Returns the 'previous node' of the shortest path tree.
|
const DistMap & | distMap () const |
| Returns a reference to the NodeMap of distances.
|
const PredMap & | predMap () const |
| Returns a reference to the shortest path tree map.
|
bool | reached (Node v) |
| Checks if a node is reachable from the root.
|
Classes |
class | DefDistMap |
| Named parameter for setting DistMap type More...
|
class | DefPredMap |
| Named parameter for setting PredMap type More...
|
class | DefProcessedMap |
| Named parameter for setting ProcessedMap type More...
|
class | DefProcessedMapToBeDefaultMap |
| Named parameter for setting the ProcessedMap type to be Graph::NodeMap<bool>. More...
|
class | DefReachedMap |
| Named parameter for setting ReachedMap type More...
|
class | UninitializedParameter |
| Exception for uninitialized parameters. More...
|