Class EulerianCircuit


  • @Deprecated
    public abstract class EulerianCircuit
    extends java.lang.Object
    Deprecated.
    This algorithm will check whether a graph is Eulerian (hence it contains an Eulerian circuit). Also, if a graph is Eulerian, the caller can obtain a list of vertices making up the Eulerian circuit. An Eulerian circuit is a circuit which traverses each edge exactly once.
    Since:
    Dec 21, 2008
    • Constructor Summary

      Constructors 
      Constructor Description
      EulerianCircuit()
      Deprecated.
       
    • Constructor Detail

      • EulerianCircuit

        public EulerianCircuit()
        Deprecated.
    • Method Detail

      • isEulerian

        public static <V,​E> boolean isEulerian​(UndirectedGraph<V,​E> graph)
        Deprecated.
        Test whether a graph is Eulerian. An undirected graph is Eulerian if it is connected and each vertex has an even degree.
        Type Parameters:
        V - the graph vertex type
        E - the graph edge type
        Parameters:
        graph - the input graph
        Returns:
        true if the graph is Eulerian, false otherwise
      • getEulerianCircuitVertices

        public static <V,​E> java.util.List<V> getEulerianCircuitVertices​(UndirectedGraph<V,​E> g)
        Deprecated.
        This method will return a list of vertices which represents the Eulerian circuit of the graph.
        Type Parameters:
        V - the graph vertex type
        E - the graph edge type
        Parameters:
        g - The graph to find an Eulerian circuit
        Returns:
        null if no Eulerian circuit exists, or a list of vertices representing the Eulerian circuit if one does exist