- Type Parameters:
V- the graph vertex type
E- the graph edge type
- All Implemented Interfaces:
K. Paton, An algorithm for finding a fundamental set of cycles for an undirected linear graph, Comm. ACM 12 (1969), pp. 514-518.
Note that Paton's algorithm produces a fundamental cycle basis while this implementation produces a weakly fundamental cycle basis. A cycle basis is called weakly fundamental if there exists a linear ordering of the cycles in a cycle basis such that each cycle includes at least one edge that is not part of any previous cycle. Every fundamental cycle basis is weakly fundamental (for all linear orderings) but not necessarily vice versa.
- Nikolay Ognyanov
Nested Class Summary
PatonCycleBaseCreate a cycle base finder for the specified graph.
graph- the input graph
IllegalArgumentException- if the graph argument is
nullor the graph is not undirected
getCycleBasisReturn an undirected cycle basis of a graph. Works only for undirected graphs which do not have multiple (parallel) edges.