anansi.algorithms.dijkstra

Members

Structs

DijkstraBfsVisitor
struct DijkstraBfsVisitor(GraphT, QueueT, DijkstraVisitorT, DistanceMapT, PredecessorMapT, WeightMapT)

A BFS visitor that transforms a normal breadth-first search algoritm into Dijkstra's shortest paths.

NullDijkstraVisitor
struct NullDijkstraVisitor(GraphT)

A default implementation of the Dijkstra visitor.

Templates

dijkstraShortestPaths
template dijkstraShortestPaths(GraphT, VertexDescriptorT, VisitorT = NullDijkstraVisitor!GraphT, WeightMapT = real[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT])
dijkstraShortestPaths
template dijkstraShortestPaths(GraphT, VisitorT, VertexDescriptorT, ColourMapT, PredecessorMapT, WeightMapT, DistanceMapT)

Meta