类 EulerianCycle
- java.lang.Object
- 
- edu.princeton.cs.algs4.EulerianCycle
 
- 
 public class EulerianCycle extends java.lang.ObjectTheEulerianCycleclass represents a data type for finding an Eulerian cycle or path in a graph. An Eulerian cycle is a cycle (not necessarily simple) that uses every edge in the graph exactly once.This implementation uses a nonrecursive depth-first search. The constructor runs in O(E + V) time, and uses O(E + 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 graphs, see EulerianPath. To compute Eulerian cycles and paths in digraphs, seeDirectedEulerianCycleandDirectedEulerianPath.For additional documentation, see Section 4.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne. 
- 
- 
构造器概要构造器 构造器 说明 EulerianCycle(Graph G)Computes an Eulerian cycle in the specified graph, if one exists.
 - 
方法概要修饰符和类型 方法 说明 java.lang.Iterable<java.lang.Integer>cycle()Returns the sequence of vertices on an Eulerian cycle.booleanhasEulerianCycle()Returns true if the graph has an Eulerian cycle.static voidmain(java.lang.String[] args)Unit tests theEulerianCycledata type.
 
- 
- 
- 
构造器详细资料- 
EulerianCyclepublic EulerianCycle(Graph G) Computes an Eulerian cycle in the specified graph, if one exists.- 参数:
- G- the graph
 
 
- 
 - 
方法详细资料- 
cyclepublic 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
 
 - 
hasEulerianCyclepublic boolean hasEulerianCycle() Returns true if the graph has an Eulerian cycle.- 返回:
- trueif the graph has an Eulerian cycle;- falseotherwise
 
 - 
mainpublic static void main(java.lang.String[] args) Unit tests theEulerianCycledata type.- 参数:
- args- the command-line arguments
 
 
- 
 
-