anansi.algorithms.dijkstra

Undocumented in source.

Members

DijkstraBfsVisitor struct DijkstraBfsVisitor(GraphT, QueueT, DijkstraVisitorT, DistanceMapT, PredecessorMapT, WeightMapT, alias sumFunction = (a, b) => a + b): A BFS visitor that transforms a normal breadth-first search algoritm into Dijkstra's shortest paths.
DijkstraQueue struct DijkstraQueue(GraphT, DistanceMapT): A priority queue item for sorting vertices by the cost to get to them.
NullDijkstraVisitor struct NullDijkstraVisitor(GraphT): A default implementation of the Dijkstra visitor.

dijkstraShortestPaths template dijkstraShortestPaths(GraphT, VertexDescriptorT, VisitorT = NullDijkstraVisitor!GraphT, WeightMapT = real[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT], alias sumFunction = (a, b) => a + b)
dijkstraShortestPaths template dijkstraShortestPaths(GraphT, VisitorT, VertexDescriptorT, ColourMapT, PredecessorMapT, WeightMapT, DistanceMapT, alias sumFunction = (a, b) => a + b)
dijkstraShortestPathsNoInit template dijkstraShortestPathsNoInit(GraphT, VertexDescriptorT, VisitorT = NullDijkstraVisitor!GraphT, ColourMapT = Colour[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT], WeightMapT = real[VertexDescriptorT], DistanceMapT = real[VertexDescriptorT], alias sumFunction = (a, b) => a + b): Undocumented in source.