V- the vertex type
E- the edge type
public class QueueBFSFundamentalCycleBasis<V,E> extends AbstractFundamentalCycleBasis<V,E>
For information on algorithms computing 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, 26-42, 1982.
The total length of the fundamental-cycle set can be as large as $O(n^3)$ where $n$ is the number of vertices of the graph.
|Constructor and Description|
|Modifier and Type||Method and Description|
Compute a spanning forest of the graph using a straightforward 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.
Copyright © 2019. All rights reserved.