Class EulerianPath

  • public class EulerianPath
    extends Object
    The EulerianPath class represents a data type for finding an Eulerian path in a graph. An Eulerian path is a path (not necessarily simple) that uses every edge in the graph exactly once.

    This implementation uses a nonrecursive depth-first search. The constructor takes Θ(E + V) time in the worst case, where E is the number of edges and V is the number of vertices. Each instance method takes Θ(1) time. It uses Θ(E + V) extra space in the worst case (not including the digraph).

    To compute Eulerian cycles in graphs, see EulerianCycle. To compute Eulerian cycles and paths in digraphs, see DirectedEulerianCycle and DirectedEulerianPath.

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

    Robert Sedgewick, Kevin Wayne, Nate Liu
    • Constructor Detail

      • EulerianPath

        public EulerianPath​(Graph G)
        Computes an Eulerian path in the specified graph, if one exists.
        G - the graph
    • Method Detail

      • path

        public Iterable<Integer> path()
        Returns the sequence of vertices on an Eulerian path.
        the sequence of vertices on an Eulerian path; null if no such path
      • hasEulerianPath

        public boolean hasEulerianPath()
        Returns true if the graph has an Eulerian path.
        true if the graph has an Eulerian path; false otherwise
      • main

        public static void main​(String[] args)
        Unit tests the EulerianPath data type.
        args - the command-line arguments