GR | Graph type. |
#include <lemon/bfs.h>
Public Types | |
typedef GR | Graph |
The graph type the algorithm runs on. | |
typedef NullMap< typename Graph::Node, typename GR::Edge > | PredMap |
The type of the map that stores the last edges of the shortest paths. | |
typedef NullMap< typename Graph::Node, bool > | ProcessedMap |
The type of the map that indicates which nodes are processed. | |
typedef Graph::template NodeMap< bool > | ReachedMap |
The type of the map that indicates which nodes are reached. | |
typedef NullMap< typename Graph::Node, int > | DistMap |
The type of the map that stores the dists of the nodes. | |
Static Public Member Functions | |
static PredMap * | createPredMap (const GR &g) |
Instantiates a PredMap. | |
static ProcessedMap * | createProcessedMap (const GR &g) |
Instantiates a ProcessedMap. | |
static ReachedMap * | createReachedMap (const GR &G) |
Instantiates a ReachedMap. | |
static DistMap * | createDistMap (const GR &g) |
Instantiates a DistMap. |
The type of the map that stores the last edges of the shortest paths. It must meet the WriteMap concept.
typedef NullMap<typename Graph::Node,bool> ProcessedMap |
typedef Graph::template NodeMap<bool> ReachedMap |
The type of the map that stores the dists of the nodes. It must meet the WriteMap concept.
static PredMap* createPredMap | ( | const GR & | g | ) | [inline, static] |
static ProcessedMap* createProcessedMap | ( | const GR & | g | ) | [inline, static] |
This function instantiates a ProcessedMap.
g | is the graph, to which we would like to define the ProcessedMap |
static ReachedMap* createReachedMap | ( | const GR & | G | ) | [inline, static] |
This function instantiates a ReachedMap.
G | is the graph, to which we would like to define the ReachedMap. |
static DistMap* createDistMap | ( | const GR & | g | ) | [inline, static] |