DijkstraSearchEvent
public enum DijkstraSearchEvent<SearchSpace> where SearchSpace : GraphProtocol
The events that occur during Dijkstra’s search within a graph.
See also
IncidenceGraph.VertexListGraph.
-
Identifies a vertex in the search space.
Declaration
Swift
public typealias Vertex = SearchSpace.VertexId -
Identifies an edge in the search space.
Declaration
Swift
public typealias Edge = SearchSpace.EdgeId -
The start of search, recording the starting vertex.
Declaration
Swift
case start(Vertex) -
When a new vertex is discovered in the search space.
Declaration
Swift
case discover(Vertex) -
When a vertex is popped off the priority queue for processing.
Declaration
Swift
case examineVertex(Vertex) -
When an edge is traversed to look for new vertices to discover.
Declaration
Swift
case examineEdge(Edge) -
When the edge forms the final segment in the new shortest path to the destination vertex.
Declaration
Swift
case edgeRelaxed(Edge) -
When the edge does not make up part of a shortest path in the search space.
Declaration
Swift
case edgeNotRelaxed(Edge) -
When a vertex’s outgoing edges have all been analyzed.
Declaration
Swift
case finish(Vertex)
View on GitHub
DijkstraSearchEvent Enumeration Reference