java.lang.Object
org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis<V,E>
org.jgrapht.alg.cycle.StackBFSFundamentalCycleBasis<V,E>
 Type Parameters:
V
 the vertex typeE
 the edge type
 All Implemented Interfaces:
CycleBasisAlgorithm<V,
E>
Generate a set of fundamental cycles by building a spanning tree (forest) using an implementation
of BFS using a LIFO Stack. The implementation first constructs the spanning forest and then
builds the fundamentalcycles set. It supports graphs with selfloops and/or graphs with multiple
(parallel) edges.
The algorithm constructs the same fundamental cycle basis as the algorithm in the following paper: K. Paton, An algorithm for finding a fundamental set of cycles for an undirected linear graph, Comm. ACM 12 (1969), pp. 514518.
The total length of the fundamentalcycle set can be as large as $O(n^3)$ where $n$ is the number of vertices of the graph.
 Author:
 Dimitrios Michail

Nested Class Summary
Nested classes/interfaces inherited from interface org.jgrapht.alg.interfaces.CycleBasisAlgorithm
CycleBasisAlgorithm.CycleBasis<V,
E>, CycleBasisAlgorithm.CycleBasisImpl<V, E> 
Field Summary
Fields inherited from class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
graph

Constructor Summary

Method Summary
Modifier and TypeMethodDescriptionCompute a spanning forest of the graph using a stack (LIFO) based BFS implementation.Methods inherited from class org.jgrapht.alg.cycle.AbstractFundamentalCycleBasis
getCycleBasis

Constructor Details

StackBFSFundamentalCycleBasis
Constructor Parameters:
graph
 the input graph


Method Details

computeSpanningForest
Compute a spanning forest of the graph using a stack (LIFO) based BFS implementation.The representation assumes that the map contains the predecessor edge of each vertex in the forest. The predecessor edge is the forest edge that was used to discover the vertex. If no such edge was used (the vertex is a leaf in the forest) then the corresponding entry must be null.
 Specified by:
computeSpanningForest
in classAbstractFundamentalCycleBasis<V,
E>  Returns:
 a map representation of a spanning forest.
