dfs_back_visitor Class Reference

DFS-vistor to get the back edges. More...

Public Member Functions
	dfs_back_visitor (std::list< diedge_descriptor > *_back)
	Constructor.
void	back_edge (diedge_descriptor e, const diGraph &G) const
	Back edge event point.
Public Attributes
std::list< diedge_descriptor > *	back
	Stores the discovered back edges.

Detailed Description

A Graph is acyclic if all back edges discovered during depth first search are deleted.

Definition at line 39 of file maxstableset.cc.

The documentation for this class was generated from the following file: