DijkstraTraversal
com.phasmidsoftware.gryphon.traverse.DijkstraTraversal
case class DijkstraTraversal[V, E]()(using evidence$1: Monoid[E], evidence$2: Ordering[E]) extends WeightedTraversal[V, E, AttributedDirectedEdge[V, E]]
Dijkstra's shortest-path traversal. See Dijkstra's Algorithm.
Uses cumulative path cost as the frontier priority. Only AttributedDirectedEdge instances are admitted — the result type is TraversalResult[V, AttributedDirectedEdge[V, E]], preserving full edge information without casts.
Requires E: {Monoid, Ordering} — Monoid extends Zero so the Zero requirement of WeightedTraversal is automatically satisfied, and combine is additionally available for cumulative path cost computation.
Type parameters
- E
-
the edge-weight type; must have Monoid and Ordering.
- V
-
the vertex type.
Attributes
- Graph
-
- Supertypes
-
trait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass Any
Members list
In this article