Implements an adjacency list based graph representation.
Implements an adjacency list based graph representation.
An adjacency list based representation speeds up traversing a graph along its paths by storing the list of connecting edges to each node.
Enables to quickly assemble mutable constrained graph companion modules.
Enables to quickly assemble mutable constrained graph companion modules. Example: {{ import scalax.collection.constrained.mutable.CompanionAlias import scalax.collection.constrained.constraints.Acyclic
object DAG extends CompanionAlias[DiEdge](Acyclic withStringPrefix "DAG") }}
Mutable directed acyclic Graph
.
Mutable undirected acyclic Graph
.
Mutable undirected connected acyclic Graph
.
Companion module for mutable directed acyclic Graph
.
Companion module for mutable undirected acyclic Graph
.
Companion module for mutable undirected connected acyclic Graph
.
Mutable constrained graph templates.