Graph.Visited

Bookkeeping structure for helping keep track of vertices that have been visited.

class Graph(A, B, EdgeDataAB = size_t, EdgeDataBA = size_t)

static

struct Visited (

Value

) {

Value[A] visitedA;

Value[B] visitedB;

alias visited(V : A) = visitedA;

alias visited(V : B) = visitedB;

void put(Vertex v, Value value);

void remove(Vertex v);

inout(Value*) opBinaryRight(Vertex v);

}

Members

Aliases

visited alias visited(V : A) = visitedA: Undocumented in source.
visited alias visited(V : B) = visitedB: Undocumented in source.

Functions

opBinaryRight inout(Value*) opBinaryRight(Vertex v): Returns true if the given vertex has been visited.
put void put(Vertex v, Value value): Adds a vertex to the list of visited vertices.
remove void remove(Vertex v): Remove a vertex from the list of visited vertices.

Variables

visitedA Value[A] visitedA;: Undocumented in source.
visitedB Value[B] visitedB;: Undocumented in source.

Meta

Source

See Implementation

button graph Graph aliases

classes

Data

enums

functions

properties

structs