SearchGraphExtension<V, E> extension

on

• Graph<V, E>

Methods

shortestPath(V source, V target, {num edgeCost(Edge<V, E> edge)?, num costEstimate(V target)?, StorageStrategy<V>? vertexStrategy}) → Path<V>?

Performs a search for the shortest path between source and target.

shortestPathAll(V source, Predicate1<V> target, {num edgeCost(Edge<V, E> edge)?, num costEstimate(V target)?, StorageStrategy<V>? vertexStrategy}) → Iterable<Path<V>>

Performs a search for the shortest paths between source and target, where the target is specified as a predicate over the vertices.