anansi ~master (2019-12-19T23:28:59Z)
Dub
Repo
dijkstraShortestPaths
anansi
algorithms
dijkstra
void
dijkstraShortestPaths
(const(GraphT) g, VertexDescriptorT src, const(WeightMapT) weights, PredecessorMapT predecessorMap, VisitorT visitor, ColourMapT colourMap, DistanceMapT distanceMap)
template
dijkstraShortestPaths
(GraphT, VisitorT, VertexDescriptorT, ColourMapT, PredecessorMapT, WeightMapT, DistanceMapT, alias sumFunction = (a, b) => a + b)
void
dijkstraShortestPaths
(
ref
const
(
GraphT
)
g
,
VertexDescriptorT
src
,
ref
const
(
WeightMapT
)
weights
,
ref
PredecessorMapT
predecessorMap
,
VisitorT
visitor
,
ref
ColourMapT
colourMap
,
ref
DistanceMapT
distanceMap
)
template
dijkstraShortestPaths
(GraphT, VertexDescriptorT, VisitorT = NullDijkstraVisitor!GraphT, WeightMapT = real[VertexDescriptorT], PredecessorMapT = VertexDescriptorT[VertexDescriptorT], alias sumFunction = (a, b) => a + b)
Members
Functions
dijkstraShortestPaths
void
dijkstraShortestPaths
(const(GraphT) g, VertexDescriptorT src, const(WeightMapT) weights, PredecessorMapT predecessorMap, VisitorT visitor, ColourMapT colourMap, DistanceMapT distanceMap)
Undocumented in source. Be warned that the author may not have intended to support it.
Meta
Source
See Implementation
anansi
algorithms
dijkstra
structs
DijkstraBfsVisitor
DijkstraQueue
NullDijkstraVisitor
templates
dijkstraShortestPaths
dijkstraShortestPathsNoInit