GraphDFS

Quick Index

KEYWORD

AUTHORS

CHANGES LOG

GOALS

USAGE

Class Summary

class GraphDFS
{

public:
	GraphDFS(leda::graph& graph_);
void	DFS();
void	DFS(leda::node u);
void	DFS_NUM(leda::node u);
protected:
	leda::graph& G;
::node_array<	leda::node> parents;
	leda::node_array< int> d,f;
	leda::node_array< int> colors;
int	dfsTimer;

}; // GraphDFS

Back to the top of GraphDFS

KEYWORD

Back to the top of GraphDFS

AUTHORS

Back to the top of GraphDFS

CHANGES LOG

Back to the top of GraphDFS

GOALS

Back to the top of GraphDFS

USAGE

Back to the top of GraphDFS

GraphDFS(leda::graph& graph_);

Constructor

  GraphDFS(leda::graph& graph_);

Back to the top of GraphDFS

void DFS();

DFS algorithm according to Cormen book (LEDA DFS does not return parent nodes)

  void DFS();

Back to the top of GraphDFS

void DFS(leda::node u);

DFS algorithm starting from a given node (assumes one connected component)

  void DFS(leda::node u);

Back to the top of GraphDFS

void DFS_NUM(leda::node u);

DFS algorithm that numbers all the nodes in DFS order starting from u

  void DFS_NUM(leda::node u);

Back to the top of GraphDFS

leda::graph& G;

graph

  leda::graph& G;

Back to the top of GraphDFS

::node_array< leda::node> parents;

parents of nodes in dfs forest

  leda::node_array< leda::node> parents;

Back to the top of GraphDFS

leda::node_array< int> d,f;

discovery and finish time for each node

  leda::node_array< int> d,f;

Back to the top of GraphDFS

leda::node_array< int> colors;

colors of the nodes in dfs forest

  leda::node_array< int> colors;

Back to the top of GraphDFS

int dfsTimer;

timer

  int dfsTimer;

Back to the top of GraphDFS

All Members

public:
void	DFS();
void	DFS(leda::node u);
void	DFS_NUM(leda::node u);
protected:
	leda::graph& G;
::node_array<	leda::node> parents;
	leda::node_array< int> d,f;
	leda::node_array< int> colors;
int	dfsTimer;

Back to the top of GraphDFS

Ancestors

Class does not inherit from any other class.

Back to the top of GraphDFS

Descendants

Class is not inherited by any others.

Back to the top of GraphDFS

Generated from source by the Cocoon utilities on Mon Dec 21 11:44:47 2009 .

Report problems to jkotula@unimax.com