An internal representation of nodes within the graph
An internal representation of nodes within the graph
The type of InnerNodeTrait for this digraph representation
the Label between a pair of nodes, or noEdgeExistsLable if no edge exists.
IllegalArgumentException
if either node is not in the graph
A Traversable (usually something more specific) of the edges
A Traversable of the edges as represented in the graph
a node that might be in this digraph
Some inner node if it exists in the digraph or None
InnerNode representation of all of the nodes in the graph.
the Label between a pair of nodes, or noEdgeExistsLabel if no edge exists.
the label to return when no edge exists
number of nodes in the graph
All the nodes in the graph
All the nodes in the graph
A directed graph with labeled edges.
v0.2.1