Public Types | Static Public Member Functions

BfsWizardDefaultTraits< GR > Struct Template Reference


Detailed Description

template<class GR>
struct lemon::BfsWizardDefaultTraits< GR >

Default traits class of bfs() function.

Template Parameters:
GRDigraph type.

#include <lemon/bfs.h>

Inheritance diagram for BfsWizardDefaultTraits< GR >:

List of all members.

Public Types

typedef GR Digraph
 The type of the digraph the algorithm runs on.
typedef Digraph::template
NodeMap< typename Digraph::Arc > 
PredMap
 The type of the map that stores the predecessor arcs of the shortest paths.
typedef NullMap< typename
Digraph::Node, bool > 
ProcessedMap
 The type of the map that indicates which nodes are processed.
typedef Digraph::template
NodeMap< bool > 
ReachedMap
 The type of the map that indicates which nodes are reached.
typedef Digraph::template
NodeMap< int > 
DistMap
 The type of the map that stores the distances of the nodes.
typedef lemon::Path< DigraphPath
 The type of the shortest paths.

Static Public Member Functions

static PredMapcreatePredMap (const Digraph &g)
 Instantiates a PredMap.
static ProcessedMapcreateProcessedMap (const Digraph &g)
 Instantiates a ProcessedMap.
static ReachedMapcreateReachedMap (const Digraph &g)
 Instantiates a ReachedMap.
static DistMapcreateDistMap (const Digraph &g)
 Instantiates a DistMap.

Member Typedef Documentation

typedef Digraph::template NodeMap<typename Digraph::Arc> PredMap

The type of the map that stores the predecessor arcs of the shortest paths. It must meet the WriteMap concept.

typedef NullMap<typename Digraph::Node,bool> ProcessedMap

The type of the map that indicates which nodes are processed. It must meet the WriteMap concept. By default it is a NullMap.

typedef Digraph::template NodeMap<bool> ReachedMap

The type of the map that indicates which nodes are reached. It must meet the ReadWriteMap concept.

typedef Digraph::template NodeMap<int> DistMap

The type of the map that stores the distances of the nodes. It must meet the WriteMap concept.

The type of the shortest paths. It must meet the Path concept.


Member Function Documentation

static PredMap* createPredMap ( const Digraph g) [inline, static]

This function instantiates a PredMap.

Parameters:
gis the digraph, to which we would like to define the PredMap.
static ProcessedMap* createProcessedMap ( const Digraph g) [inline, static]

This function instantiates a ProcessedMap.

Parameters:
gis the digraph, to which we would like to define the ProcessedMap.
static ReachedMap* createReachedMap ( const Digraph g) [inline, static]

This function instantiates a ReachedMap.

Parameters:
gis the digraph, to which we would like to define the ReachedMap.
static DistMap* createDistMap ( const Digraph g) [inline, static]

This function instantiates a DistMap.

Parameters:
gis the digraph, to which we would like to define the DistMap
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines