hasEulerianPath<V, E> function
Checks if a graph has an Eulerian path (a trail visiting every edge exactly once).
Implementation
bool hasEulerianPath<V, E>({
required Iterable<V> vertices,
required Iterable<Edge<V, E>> Function(V vertex) outgoingEdgesOf,
required bool isDirected,
int Function(V vertex)? inDegreeOf,
int Function(V vertex)? outDegreeOf,
int Function(V vertex)? degreeOf,
bool Function(V u, V v)? containsEdge,
StorageStrategy<V>? vertexStrategy,
}) =>
findEulerianPath<V, E>(
vertices: vertices,
outgoingEdgesOf: outgoingEdgesOf,
isDirected: isDirected,
inDegreeOf: inDegreeOf,
outDegreeOf: outDegreeOf,
degreeOf: degreeOf,
containsEdge: containsEdge,
circuit: false,
vertexStrategy: vertexStrategy,
) !=
null;