类 DirectedEulerianCycle
- java.lang.Object
-
- edu.princeton.cs.algs4.DirectedEulerianCycle
-
public class DirectedEulerianCycle extends java.lang.ObjectTheDirectedEulerianCycleclass represents a data type for finding an Eulerian cycle or path in a digraph. An Eulerian cycle is a cycle (not necessarily simple) that uses every edge in the digraph exactly once.This implementation uses a nonrecursive depth-first search. The constructor runs in O(E + V) time, and uses O(V) extra space, where E is the number of edges and V the number of vertices All other methods take O(1) time.
To compute Eulerian paths in digraphs, see
DirectedEulerianPath. To compute Eulerian cycles and paths in undirected graphs, seeEulerianCycleandEulerianPath.For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
-
-
构造器概要
构造器 构造器 说明 DirectedEulerianCycle(Digraph G)Computes an Eulerian cycle in the specified digraph, if one exists.
-
方法概要
修饰符和类型 方法 说明 java.lang.Iterable<java.lang.Integer>cycle()Returns the sequence of vertices on an Eulerian cycle.booleanhasEulerianCycle()Returns true if the digraph has an Eulerian cycle.static voidmain(java.lang.String[] args)Unit tests theDirectedEulerianCycledata type.
-
-
-
构造器详细资料
-
DirectedEulerianCycle
public DirectedEulerianCycle(Digraph G)
Computes an Eulerian cycle in the specified digraph, if one exists.- 参数:
G- the digraph
-
-
方法详细资料
-
cycle
public java.lang.Iterable<java.lang.Integer> cycle()
Returns the sequence of vertices on an Eulerian cycle.- 返回:
- the sequence of vertices on an Eulerian cycle;
nullif no such cycle
-
hasEulerianCycle
public boolean hasEulerianCycle()
Returns true if the digraph has an Eulerian cycle.- 返回:
trueif the digraph has an Eulerian cycle;falseotherwise
-
main
public static void main(java.lang.String[] args)
Unit tests theDirectedEulerianCycledata type.- 参数:
args- the command-line arguments
-
-