DijkstraBfsVisitor

A BFS visitor that transforms a normal breadth-first search algoritm into Dijkstra's shortest paths.

Remark: Not every sumFunction works correctly.

package

struct DijkstraBfsVisitor (

GraphT

QueueT

DijkstraVisitorT

DistanceMapT

PredecessorMapT

WeightMapT

alias sumFunction =

(

a

,

b

)

=> a + b

) {

alias Vertex = GraphT.VertexDescriptor;

alias Edge = GraphT.EdgeDescriptor;

this(DijkstraVisitorT visitor, DistanceMapT distanceMap, const(WeightMapT) weightMap, PredecessorMapT predecessorMap, QueueT queue);

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

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

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

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

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

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

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

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

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

}

Constructors

this this(DijkstraVisitorT visitor, DistanceMapT distanceMap, const(WeightMapT) weightMap, PredecessorMapT predecessorMap, QueueT queue): Undocumented in source.

Members

Aliases

Edge alias Edge = GraphT.EdgeDescriptor: Undocumented in source.
Vertex alias Vertex = GraphT.VertexDescriptor: Undocumented in source.

Functions

blackTarget void blackTarget(const(GraphT) g, Edge e): Undocumented in source. Be warned that the author may not have intended to support it.
discoverVertex void discoverVertex(const(GraphT) g, Vertex v): Undocumented in source. Be warned that the author may not have intended to support it.
examineEdge void examineEdge(const(GraphT) g, Edge e): Undocumented in source. Be warned that the author may not have intended to support it.
examineVertex void examineVertex(const(GraphT) g, Vertex v): Undocumented in source. Be warned that the author may not have intended to support it.
finishVertex void finishVertex(const(GraphT) g, Vertex v): Undocumented in source. Be warned that the author may not have intended to support it.
greyTarget void greyTarget(const(GraphT) g, Edge e): Undocumented in source. Be warned that the author may not have intended to support it.
initVertex void initVertex(const(GraphT) g, Vertex v): Passes the call through to the supplied Dijkstra visitor.
nonTreeEdge void nonTreeEdge(const(GraphT) g, Edge e): Undocumented in source. Be warned that the author may not have intended to support it.
treeEdge void treeEdge(const(GraphT) g, Edge e): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

anansi algorithms dijkstra structs

templates