UndirectedGraph

Undocumented in source.

struct UndirectedGraph (

Node

Weight = void

) {

enum isWeighted;

alias adjacency_t = Weight;

alias adjacency_t = bool;

static Edge edge(T args);

bool[Node] _nodes;

adjacency_t[Node][Node] _adjacency;

Node[] nodes [@property getter];

auto edges [@property getter];

auto edges [@property getter];

this(Node[] nodes);

this(Node[] nodes, Edge[] edges);

void requireNode(Node node);

void requireNode(Node node);

void addNode(Node node);

void addNode(Node node);

void addEdge(Edge edge);

}

Constructors

this this(Node[] nodes)
this(Node[] nodes, Edge[] edges): Construct a graph from a set of nodes (and edges).

Members

Aliases

adjacency_t alias adjacency_t = Weight: Undocumented in source.
adjacency_t alias adjacency_t = bool: Undocumented in source.

Functions

addEdge void addEdge(Edge edge): Inserts edge into the graph thrwoing an exception if already present.
addNode void addNode(Node node): Inserts node into the node list throwing an exception if already present.
requireNode void requireNode(Node node): Inserts node into the node list if not yet present.

Properties

edges auto edges [@property getter]: Returns a list of all edges in this graph.
nodes Node[] nodes [@property getter]: Returns a list of the nodes in this graph.

Static functions

edge Edge edge(T args): Construct an edge for this graph.

Static variables

isWeighted enum isWeighted;: Undocumented in source.

Structs

Edge struct Edge: Undocumented in source.

Variables

_adjacency adjacency_t[Node][Node] _adjacency;: Undocumented in source.
_nodes bool[Node] _nodes;: Undocumented in source.

Meta

Source

See Implementation