DfsVisitor Struct Template Reference

#include <lemon/dfs.h>

List of all members.


Detailed Description

template<typename _Graph>
struct lemon::DfsVisitor< _Graph >

It gives a simple interface for a functional interface for dfs traversal. The traversal on a linear data structure.


Public Member Functions

void discover (const Edge &edge)
 Called when the edge reach a node.
void reach (const Node &node)
 Called when the node reached first time.
void backtrack (const Edge &edge)
 Called when we step back on an edge.
void leave (const Node &node)
 Called when we step back from the node.
void examine (const Edge &edge)
 Called when the edge examined but target of the edge already discovered.
void start (const Node &node)
 Called for the source node of the dfs.
void stop (const Node &node)
 Called when we leave the source node of the dfs.


Member Function Documentation

void discover const Edge &  edge  )  [inline]
 

It is called when the dfs find an edge which target is not reached yet.

void reach const Node &  node  )  [inline]
 

It is Called when the node reached first time.

void backtrack const Edge &  edge  )  [inline]
 

It is called when the dfs should step back on the edge.

void leave const Node &  node  )  [inline]
 

It is called when we step back from the node.

void examine const Edge &  edge  )  [inline]
 

It called when the edge examined but the target of the edge already discovered.

void start const Node &  node  )  [inline]
 

It is called for the source node of the dfs.

void stop const Node &  node  )  [inline]
 

It is called when we leave the source node of the dfs.


The documentation for this struct was generated from the following file:
Generated on Fri Feb 3 18:40:51 2006 for LEMON by  doxygen 1.4.6