hasEulerianPath<V, E> function

bool hasEulerianPath<V, E>({
  1. required Iterable<V> vertices,
  2. required Iterable<Edge<V, E>> outgoingEdgesOf(
    1. V vertex
    ),
  3. required bool isDirected,
  4. int inDegreeOf(
    1. V vertex
    )?,
  5. int outDegreeOf(
    1. V vertex
    )?,
  6. int degreeOf(
    1. V vertex
    )?,
  7. bool containsEdge(
    1. V u,
    2. V v
    )?,
  8. StorageStrategy<V>? vertexStrategy,
})

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;