Graph Search
[Algorithms]

---

Detailed Description

This group describes the common graph search algorithms like Breadth-first search (Bfs) and Depth-first search (Dfs).

Classes
class	Bfs< GR, TR >
	BFS algorithm class. More...
class	BfsVisit< _Graph, _Visitor, _Traits >
	BFS Visit algorithm class. More...
class	Dfs< GR, TR >
	DFS algorithm class. More...
class	DfsVisit< _Graph, _Visitor, _Traits >
	DFS Visit algorithm class. More...
class	MaxCardinalitySearch< _Graph, _CapacityMap, _Traits >
	Maximum Cardinality Search algorithm class. More...
Files
file	bfs.h
	Bfs algorithm.
file	dfs.h
	Dfs algorithm.
Functions
template<class GR >
BfsWizard< BfsWizardBase< GR > >	bfs (const GR &g, typename GR::Node s=INVALID)
	Function type interface for Bfs algorithm.
template<class GR >
DfsWizard< DfsWizardBase< GR > >	dfs (const GR &g, typename GR::Node s=INVALID)
	Function type interface for Dfs algorithm.

---

Function Documentation

BfsWizard<BfsWizardBase<GR> > lemon::bfs	(	const GR &	g,
		typename GR::Node	s = INVALID
	)			[inline]

Function type interface for Bfs algorithm.

This function also has several named parameters, they are declared as the members of class BfsWizard. The following example shows how to use these parameters.

       bfs(g,source).predMap(preds).run();

Warning:

Don't forget to put the run() to the end of the parameter list.

See also:

BfsWizard

Bfs

DfsWizard<DfsWizardBase<GR> > lemon::dfs	(	const GR &	g,
		typename GR::Node	s = INVALID
	)			[inline]

Function type interface for Dfs algorithm.

This function also has several named parameters, they are declared as the members of class DfsWizard. The following example shows how to use these parameters.

       dfs(g,source).predMap(preds).run();

Warning:

Don't forget to put the run() to the end of the parameter list.

See also:

DfsWizard

Dfs