Uses of Class
graph.trees.dfs.DFSTree

Packages that use DFSTree

Package	Description
graph.algorithms.lrpartition	Classes related to LR partitions.
graph.algorithms.numbering	Classes represent different numberings of vertices.
graph.algorithms.planarity	Implementations of different planarity testing algorithms.
graph.properties.splitting	Implementations of algorithms for splitting graph into bi- and triconnected components.
graph.traversal	Classes implementing different graph traversal algorithms, like DFS and Dijkstra's shortest path.

Uses of DFSTree in graph.algorithms.lrpartition

Methods in graph.algorithms.lrpartition with parameters of type DFSTree

Modifier and Type	Method and Description
boolean	LRPartition.createLRPartition(DFSTree<V,E> tree)

Constructors in graph.algorithms.lrpartition with parameters of type DFSTree

Constructor and Description
LRPartitionSet(DFSTree<V,E> tree)

Uses of DFSTree in graph.algorithms.numbering

Constructors in graph.algorithms.numbering with parameters of type DFSTree

Constructor and Description
DFSNumbering(DFSTree<V,E> dfsTree)

Uses of DFSTree in graph.algorithms.planarity

Methods in graph.algorithms.planarity with parameters of type DFSTree

Modifier and Type	Method and Description
Path<V,E>	FraysseixMendezPlanarity.findFundamentalCycle(DFSTree<V,E> tree, E edge) Implementation of the procedure for finding a fundamental cycle

Uses of DFSTree in graph.properties.splitting

Methods in graph.properties.splitting that return DFSTree

Modifier and Type	Method and Description
DFSTree<V,E>	SeparationPairSplitting.getTree()

Uses of DFSTree in graph.traversal

Methods in graph.traversal that return DFSTree

Modifier and Type	Method and Description
DFSTree<V,E>	DFSTreeTraversal.formDFSTree() Forms a DFS tree whose root is the first vertex of the associated graph
DFSTree<V,E>	DFSTreeTraversal.formDFSTree(V root) Forms a DFS tree with the given root