|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.jgrapht.alg.cycle.TiernanSimpleCycles<V,E>
V
- the vertex type.E
- the edge type.public class TiernanSimpleCycles<V,E>
Find all simple cycles of a directed graph using the Tiernan's algorithm.
See:
Constructor Summary | |
---|---|
TiernanSimpleCycles()
Create a simple cycle finder with an unspecified graph. |
|
TiernanSimpleCycles(DirectedGraph<V,E> graph)
Create a simple cycle finder for the specified graph. |
Method Summary | |
---|---|
List<List<V>> |
findSimpleCycles()
Finds the simple cycles of the graph. Note that the full algorithm is executed on every call since the graph may have changed between calls. |
DirectedGraph<V,E> |
getGraph()
Returns the graph on which the simple cycle search algorithm is executed by this object. |
void |
setGraph(DirectedGraph<V,E> graph)
Sets the graph on which the simple cycle search algorithm is executed by this object. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public TiernanSimpleCycles()
public TiernanSimpleCycles(DirectedGraph<V,E> graph)
graph
- - the DirectedGraph in which to find cycles.
IllegalArgumentException
- if the graph argument is
null
.Method Detail |
---|
public DirectedGraph<V,E> getGraph()
getGraph
in interface DirectedSimpleCycles<V,E>
public void setGraph(DirectedGraph<V,E> graph)
setGraph
in interface DirectedSimpleCycles<V,E>
graph
- the graph.public List<List<V>> findSimpleCycles()
findSimpleCycles
in interface DirectedSimpleCycles<V,E>
null
.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |