AdjacencyList

Undocumented in source.

struct AdjacencyList (

alias VertexStorage = VecS

alias EdgeStorage = VecS

Directionality = DirectedS

VertexProperty = NoProperty

EdgeProperty = NoProperty

) {

alias VertexDescriptor = VertexStorage.IndexType;

enum IsUndirected;

enum IsBidirectional;

enum IsDirected;

struct EdgeDescriptor;

VertexStorage.Store!Vertex _vertices;

EdgeList _edges;

VertexDescriptor addVertex(VertexProperty value);

vertexCount [@property getter];

auto vertices [@property getter];

static if(!isNone!VertexProperty)

inout(VertexProperty) opIndex(VertexDescriptor v);

void removeVertex(VertexDescriptor vertex);

alias AddEdgeResult = Tuple!(EdgeDescriptor, "edge", bool, "addedNew");

AddEdgeResult addEdge(VertexDescriptor src, VertexDescriptor dst, EdgeProperty value);

void removeEdge(EdgeDescriptor edge);

VertexDescriptor source(EdgeDescriptor edge);

VertexDescriptor target(EdgeDescriptor edge);

auto outEdges(VertexDescriptor vertex);

size_t outDegree(VertexDescriptor vertex);

static if(IsBidirectional)

size_t inDegree(VertexDescriptor vertex);

static if(IsBidirectional)

auto inEdges(VertexDescriptor vertex);

static if(!isNone!EdgeProperty)

EdgeProperty opIndex(EdgeDescriptor e);

static if(!isNone!EdgeProperty)

const(EdgeProperty) opIndex(EdgeDescriptor e);

size_t edgeCount [@property getter];

auto edgesBetween(VertexDescriptor from, VertexDescriptor to);

}

Members

Aliases

AddEdgeResult alias AddEdgeResult = Tuple!(EdgeDescriptor, "edge", bool, "addedNew"): A tuple with some names to help unpacking the result of an addEdge call.
VertexDescriptor alias VertexDescriptor = VertexStorage.IndexType: Undocumented in source.

Functions

addEdge AddEdgeResult addEdge(VertexDescriptor src, VertexDescriptor dst, EdgeProperty value): Adds an edge to the graph.
addVertex VertexDescriptor addVertex(VertexProperty value): Adds a new vertex to the graph.
edgesBetween auto edgesBetween(VertexDescriptor from, VertexDescriptor to): Undocumented in source. Be warned that the author may not have intended to support it.
inDegree size_t inDegree(VertexDescriptor vertex): Undocumented in source. Be warned that the author may not have intended to support it.
inEdges auto inEdges(VertexDescriptor vertex): Undocumented in source. Be warned that the author may not have intended to support it.
opIndex inout(VertexProperty) opIndex(VertexDescriptor v): Undocumented in source. Be warned that the author may not have intended to support it.
opIndex const(EdgeProperty) opIndex(EdgeDescriptor e): Undocumented in source. Be warned that the author may not have intended to support it.
opIndex EdgeProperty opIndex(EdgeDescriptor e): Undocumented in source. Be warned that the author may not have intended to support it.
outDegree size_t outDegree(VertexDescriptor vertex): Undocumented in source. Be warned that the author may not have intended to support it.
outEdges auto outEdges(VertexDescriptor vertex): Lists the outbound edges of a given vertex.
removeEdge void removeEdge(EdgeDescriptor edge): Removes an edge from the graph.
removeVertex void removeVertex(VertexDescriptor vertex): Removes a vertex from the graph. The complexity of this operaton varies with the storage class. For storage classes that have stable indexes, this is O(1). For classes with unstable indexes this is at least O(n), where n is the number of edges in the graph, due to the VertexDescriptors in all the edges having to be fixed up.
source VertexDescriptor source(EdgeDescriptor edge): Fetches the descriptor of the source vertex of the given edge.
target VertexDescriptor target(EdgeDescriptor edge): Fetches the descriptor of the target vertex of the supplied edge.

Manifest constants

IsBidirectional enum IsBidirectional;: Undocumented in source.
IsDirected enum IsDirected;: Undocumented in source.
IsUndirected enum IsUndirected;: Undocumented in source.

Properties

edgeCount size_t edgeCount [@property getter]: Fetches the total number of edges in the graph. For debugging purposes only.
vertexCount vertexCount [@property getter]: Undocumented in source. Be warned that the author may not have intended to support it.
vertices auto vertices [@property getter]: Returns a forward range that yields the descriptors for each vertex in the graph. The order of the vertices is undefined.

Structs

EdgeDescriptor struct EdgeDescriptor: A handle that can be used by callers to identify a given edge.

Variables

_edges EdgeList _edges;: The main edge store
_vertices VertexStorage.Store!Vertex _vertices;: The main vertex store.

Meta

Source

See Implementation

anansi adjacencylist functions

checkEdges

structs

AdjacencyList