Click or drag to resize
DirectedEulerianPath Class

The DirectedEulerianPath class represents a data type for finding an Eulerian path in a digraph. An Eulerian path is a path (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 cycles in digraphs, see . To compute Eulerian cycles and paths in undirected graphs, see and .

Inheritance Hierarchy
SystemObject
  Algs4NetDirectedEulerianPath

Namespace: Algs4Net
Assembly: Algs4Net (in Algs4Net.dll) Version: 1.0.0.0 (1.0.0.0)
Syntax
C#
Copy
public class DirectedEulerianPath

The DirectedEulerianPath type exposes the following members.

Constructors
  NameDescription
Public methodDirectedEulerianPath
Computes an Eulerian path in the specified digraph, if one exists.
Top
Properties
  NameDescription
Public propertyHasEulerianPath
Returns true if the digraph has an Eulerian path.
Top
Methods
  NameDescription
Public methodStatic memberMainTest
Demo test the DirectedEulerianPath data type.
Public methodPath
Returns the sequence of vertices on an Eulerian path.
Top
Remarks

For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

This class is a C# port from the original Java class DirectedEulerianPath implementation by the respective authors.

See Also