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(Graph<V,E> graph)
Create a simple cycle finder for the specified graph.
|
Modifier and Type | Method and Description |
---|---|
List<List<V>> |
findSimpleCycles()
Find the simple cycles of the graph.
|
Graph<V,E> |
getGraph()
Returns the graph on which the simple cycle search algorithm is executed by this object.
|
void |
setGraph(Graph<V,E> graph)
Sets the graph on which the simple cycle search algorithm is executed by this object.
|
public TiernanSimpleCycles()
public TiernanSimpleCycles(Graph<V,E> graph)
graph
- - the DirectedGraph in which to find cycles.IllegalArgumentException
- if the graph argument is
null
.public Graph<V,E> getGraph()
getGraph
in interface DirectedSimpleCycles<V,E>
public void setGraph(Graph<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 © 2018. All rights reserved.