Package org.jgrapht.alg.cycle
Class SzwarcfiterLauerSimpleCycles<V,E>
- java.lang.Object
-
- org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles<V,E>
-
- Type Parameters:
V
- the vertex type.E
- the edge type.
- All Implemented Interfaces:
DirectedSimpleCycles<V,E>
public class SzwarcfiterLauerSimpleCycles<V,E> extends java.lang.Object implements DirectedSimpleCycles<V,E>
Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's algorithm.See:
J.L.Szwarcfiter and P.E.Lauer, Finding the elementary cycles of a directed graph in $O(n + m)$ per cycle, Technical Report Series, #60, May 1974, Univ. of Newcastle upon Tyne, Newcastle upon Tyne, England.- Author:
- Nikolay Ognyanov
-
-
Constructor Summary
Constructors Constructor Description SzwarcfiterLauerSimpleCycles()
Create a simple cycle finder with an unspecified graph.SzwarcfiterLauerSimpleCycles(Graph<V,E> graph)
Create a simple cycle finder for the specified graph.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.List<java.util.List<V>>
findSimpleCycles()
Find the simple cycles of the graph.Graph<V,E>
getGraph()
Get the graphvoid
setGraph(Graph<V,E> graph)
Set the graph
-
-
-
Method Detail
-
findSimpleCycles
public java.util.List<java.util.List<V>> findSimpleCycles()
Find the simple cycles of the graph.- Specified by:
findSimpleCycles
in interfaceDirectedSimpleCycles<V,E>
- Returns:
- The list of all simple cycles. Possibly empty but never
null
.
-
-