anansi ~master (2019-12-19T23:28:59Z)

DijkstraBfsVisitor.finishVertex

anansi algorithms dijkstra DijkstraBfsVisitor
Undocumented in source. Be warned that the author may not have intended to support it.
struct DijkstraBfsVisitor(GraphT, QueueT, DijkstraVisitorT, DistanceMapT, PredecessorMapT, WeightMapT, alias sumFunction = (a, b) => a + b)
void
finishVertex
(
ref const(GraphT) g
,
Vertex v
)

Meta

Source

See Implementation

anansi algorithms dijkstra DijkstraBfsVisitor aliasesconstructorsfunctions

Page generated by adrdox