Package org.jgrapht.alg
Class EulerianCircuit
- java.lang.Object
-
- org.jgrapht.alg.EulerianCircuit
-
@Deprecated public abstract class EulerianCircuit extends java.lang.Object
Deprecated.useHierholzerEulerianCycle
insteadThis 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.
-
Method Summary
All Methods Static Methods Concrete Methods Deprecated Methods Modifier and Type Method Description 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.static <V,E>
booleanisEulerian(UndirectedGraph<V,E> graph)
Deprecated.Test whether a graph is Eulerian.
-
-
-
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 typeE
- 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 typeE
- 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
-
-