anansi ~master (2019-12-19T23:28:59Z)
Dub
Repo
DijkstraBfsVisitor.initVertex
anansi
algorithms
dijkstra
DijkstraBfsVisitor
Passes the call through to the supplied Dijkstra visitor.
struct
DijkstraBfsVisitor
(GraphT, QueueT, DijkstraVisitorT, DistanceMapT, PredecessorMapT, WeightMapT, alias sumFunction = (a, b) => a + b)
void
initVertex
(
ref
const
(
GraphT
)
g
,
Vertex
v
)
Meta
Source
See Implementation
anansi
algorithms
dijkstra
DijkstraBfsVisitor
aliases
Edge
Vertex
constructors
this
functions
blackTarget
discoverVertex
examineEdge
examineVertex
finishVertex
greyTarget
initVertex
nonTreeEdge
treeEdge
Passes the call through to the supplied Dijkstra visitor.