Implements an incident list based mutable graph representation.
A growable and compactable
mutable.Set implementation based on
This trait contains mutating edge addition methods that don't require an outer edge.
The main trait for mutable graphs bundling the functionality of traits concerned with specific aspects.
the type of the nodes (vertices) in this graph.
the kind of the edges in this graph.
Trait with common mutable Graph methods.
A basic ArraySet implementation suitable for efficient add operations.
The main companion object for mutable graphs.