V
 the vertex type.E
 the edge type.public class TiernanSimpleCycles<V,E> extends Object implements DirectedSimpleCycles<V,E>
See:
J.C.Tiernan An Efficient Search Algorithm Find the Elementary Circuits of a Graph.,
Communications of the ACM, vol.13, 12, (1970), pp. 722  726.
Constructor and Description 

TiernanSimpleCycles()
Create a simple cycle finder with an unspecified graph.

TiernanSimpleCycles(DirectedGraph<V,E> graph)
Create a simple cycle finder for the specified graph.

Modifier and Type  Method and Description 

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.

public TiernanSimpleCycles()
public TiernanSimpleCycles(DirectedGraph<V,E> graph)
graph
  the DirectedGraph in which to find cycles.IllegalArgumentException
 if the graph argument is
null
.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
.Copyright © 2017. All rights reserved.