NullVisitor

A default implementation of the depth-first-search visitor concept. More specialised visitors can delegate the bits that they don't care about to an instance of NullVisitor without having to re-implement them.

Also servers as a handy point for documenting the visitor interface.

struct NullVisitor (

GraphT

) if (

isGraph!GraphT

) {

alias Vertex = GraphT.VertexDescriptor;

alias Edge = GraphT.EdgeDescriptor;

void initVertex(const(GraphT) g, Vertex v);

void startVertex(const(GraphT) g, Vertex v);

void discoverVertex(const(GraphT) g, Vertex v);

void examineEdge(const(GraphT) g, Edge e);

void treeEdge(const(GraphT) g, Edge e);

void backEdge(const(GraphT) g, Edge e);

void forwardOrCrossEdge(const(GraphT) g, Edge e);

void finishVertex(const(GraphT) g, Vertex e);

}

Members

Aliases

Edge alias Edge = GraphT.EdgeDescriptor: An edge in a GraphT
Vertex alias Vertex = GraphT.VertexDescriptor: A vertex in a GraphT

Functions

backEdge void backEdge(const(GraphT) g, Edge e): Called when an edge has been identified as part of a cycle
discoverVertex void discoverVertex(const(GraphT) g, Vertex v): Called when a vertex is first encountered during the search.
examineEdge void examineEdge(const(GraphT) g, Edge e): Called when an edge is being expanded.
finishVertex void finishVertex(const(GraphT) g, Vertex e): Called whan all of the adjacent nodes of a vertex have been examined.
forwardOrCrossEdge void forwardOrCrossEdge(const(GraphT) g, Edge e): Called when an edge crosses to a pre-existing spanning tree
initVertex void initVertex(const(GraphT) g, Vertex v): Called when a vertex is set to its initial state, before the search.
startVertex void startVertex(const(GraphT) g, Vertex v): Called when a vertex is identified as the root of a depth-first spanning tree
treeEdge void treeEdge(const(GraphT) g, Edge e): Called when an edge has been identified as part of the current spanning tree.

NullVisitor

Members

Aliases

Functions

Meta

Source