anansi ~master (2019-12-19T23:28:59Z)
Dub
Repo
NullVisitor.finishVertex
anansi
algorithms
dfs
NullVisitor
Called whan all of the adjacent nodes of a vertex have been examined.
struct
NullVisitor
(GraphT)
void
finishVertex
(
ref
const
(
GraphT
)
g
,
Vertex
e
)
if
(
isGraph
!
GraphT
)
Meta
Source
See Implementation
anansi
algorithms
dfs
NullVisitor
aliases
Edge
Vertex
functions
backEdge
discoverVertex
examineEdge
finishVertex
forwardOrCrossEdge
initVertex
startVertex
treeEdge
Called whan all of the adjacent nodes of a vertex have been examined.