UndirectedGraph.Edge

Undocumented in source.

struct UndirectedGraph(Node, Weight = void)

static

struct Edge {

static if(isWeighted)

Weight weight;

this(Node start, Node end);

this(Node start, Node end, Weight weight);

Node start [@property getter];

Node end [@property getter];

Node target(Node from);

alias source = target;

bool opEquals(Edge other);

int opCmp(Edge other);

Node getCommonNode(Edge other);

}

Constructors

this this(Node start, Node end)
this(Node start, Node end, Weight weight): Construct an edge.

Members

Aliases

source alias source = target: Returns the other node of this edge.

Functions

getCommonNode Node getCommonNode(Edge other): Returns the node that is common to this and other.
opCmp int opCmp(Edge other): Orders edge lexicographically by start, end.
opEquals bool opEquals(Edge other): Two edges are equal iff their incident nodes are the same.
target Node target(Node from): Returns the other node of this edge.

Properties

end Node end [@property getter]: Get the end of this edge, i.e. the larger of both incident nodes.
start Node start [@property getter]: Get the start of this edge, i.e. the smaller of both incident nodes.

Variables

_end Node _end;: Undocumented in source.
_start Node _start;: Undocumented in source.
weight Weight weight;: Undocumented in source.

Meta

Source

See Implementation

dalicious math UndirectedGraph aliases

adjacency_t

constructors

this

functions

properties

static functions

edge

static variables

isWeighted

structs

Edge

variables