Package org.graph4j.eulerian
Class HierholzerEulerianTrail
java.lang.Object
org.graph4j.GraphAlgorithm
org.graph4j.eulerian.HierholzerEulerianTrail
An Eulerian trail is a trail visits every edge exactly once.
- Author:
- Cristian Frăsinaru
- See Also:
-
Field Summary
Fields inherited from class org.graph4j.GraphAlgorithm
directed, graph -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class org.graph4j.GraphAlgorithm
getGraph
-
Constructor Details
-
HierholzerEulerianTrail
- Parameters:
graph- the input graph
-
-
Method Details
-
findTrail
- Returns:
- an Eulerian trail, or
nullif the graph has no Eulerian trail.
-
hasEulerianTrail
public boolean hasEulerianTrail()- Returns:
trueif the graph has an Eulerian trail
-