V
 the vertex typeE
 the edge typepublic abstract class AbstractFundamentalCycleBasis<V,E> extends Object implements CycleBasisAlgorithm<V,E>
For information on algorithms and heuristics for the computation of fundamental cycle bases see the following paper: Narsingh Deo, G. Prabhu, and M. S. Krishnamoorthy. Algorithms for Generating Fundamental Cycles in a Graph. ACM Trans. Math. Softw. 8, 1, 2642, 1982.
The implementation returns a fundamental cycle basis as an undirected cycle basis. For a discussion of different kinds of cycle bases in graphs see the following paper: Christian Liebchen, and Romeo Rizzi. Classes of Cycle Bases. Discrete Applied Mathematics, 155(3), 337355, 2007.
CycleBasisAlgorithm.CycleBasis<V,E>, CycleBasisAlgorithm.CycleBasisImpl<V,E>
Constructor and Description 

AbstractFundamentalCycleBasis(Graph<V,E> graph)
Constructor

Modifier and Type  Method and Description 

protected abstract Map<V,E> 
computeSpanningForest()
Compute a spanning forest of the graph.

CycleBasisAlgorithm.CycleBasis<V,E> 
getCycleBasis()
Return a list of cycles forming an undirected cycle basis of a graph.

public CycleBasisAlgorithm.CycleBasis<V,E> getCycleBasis()
getCycleBasis
in interface CycleBasisAlgorithm<V,E>
protected abstract Map<V,E> computeSpanningForest()
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.
Copyright © 2018. All rights reserved.