net.walend.disentangle.graph.mutable
MatrixLabelDigraph
Related Docs:
object MatrixLabelDigraph
| package mutable
net.walend.disentangle.graph.mutable
An internal representation of nodes within the graph
An internal representation of nodes within the graph
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 type of InnerNodeTrait for this digraph representation
O(n^2)
A Traversable of the edges as represented in the graph
O(ln(n))
O(ln(n))
a node that might be in this digraph
Some inner node if it exists in the digraph or None
O(1)
O(1)
O(n)
O(n)
InnerNode representation of all of the nodes in the graph.
O(1)
O(1)
the label connecting nodes at index i and j, or noEdgeExistsLabel
O(1)
O(1)
the edge between start and end or noEdgeExistsValue
the label to return when no edge exists
O(1)
O(1)
O(1)
O(1)
O(1)
O(1)
O(1)
Provides constant-time access and mutator for edges. Stores Nodes in a Vector and Labels in a Vector of ArrayBuffers.
The constructor is O(n)
v0.1.0