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
 BFS algorithm class. More...
class  BfsVisit
 BFS algorithm class with visitor interface. More...
class  Dfs
 DFS algorithm class. More...
class  DfsVisit
 DFS algorithm class with visitor interface. More...

Files

file  bfs.h
 BFS algorithm.
file  dfs.h
 DFS algorithm.

Functions

template<class GR >
BfsWizard< BfsWizardBase< GR > > bfs (const GR &digraph)
 Function-type interface for BFS algorithm.
template<class GR >
DfsWizard< DfsWizardBase< GR > > dfs (const GR &digraph)
 Function-type interface for DFS algorithm.

Function Documentation

BfsWizard<BfsWizardBase<GR> > lemon::bfs ( const GR &  digraph  )  [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 examples show how to use these parameters.

       // Compute shortest path from node s to each node
       bfs(g).predMap(preds).distMap(dists).run(s);
     
       // Compute shortest path from s to t
       bool reached = bfs(g).path(p).dist(d).run(s,t);
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 &  digraph  )  [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 examples show how to use these parameters.

       // Compute the DFS tree
       dfs(g).predMap(preds).distMap(dists).run(s);
     
       // Compute the DFS path from s to t
       bool reached = dfs(g).path(p).dist(d).run(s,t);
Warning:
Don't forget to put the run() to the end of the parameter list.
See also:
DfsWizard

Dfs


Generated on Sun Dec 7 10:49:37 2008 for LEMON by  doxygen 1.5.7.1