DijkstraSearchIterable<V> constructor

DijkstraSearchIterable<V>({
  1. required Iterable<V> startVertices,
  2. required Iterable<V> successorsOf(
    1. V vertex
    ),
  3. required bool targetPredicate(
    1. V vertex
    ),
  4. num edgeCost(
    1. V source,
    2. V target
    )?,
  5. StorageStrategy<V>? vertexStrategy,
})

Implementation

DijkstraSearchIterable({
  required this.startVertices,
  required this.successorsOf,
  required this.targetPredicate,
  num Function(V source, V target)? edgeCost,
  StorageStrategy<V>? vertexStrategy,
})  : edgeCost = edgeCost ?? constantFunction2(1),
      vertexStrategy = vertexStrategy ?? StorageStrategy.defaultStrategy();