Implements an incident list based mutable graph representation.
A growable and compactable mutable.Set
implementation based on Array
and mutable.Set
.
A growable and compactable mutable.Set
implementation based on Array
and mutable.Set
.
It switches to the latter representation as soon as a given threshold for the number of
elements is reached. Thus this implementation is a kind of mixture of
scala.collection.mutable{ResizableArray, Set, HashSet} aimed at increasing the performance
of sets having up to 200 to 250 elements.
This trait contains mutating edge addition methods that don't require an outer edge.
This trait contains mutating edge addition methods that don't require an outer edge.
These methods are kept separately from mutable.GraphLike
solely for convenience.
The main trait for mutable graphs bundling the functionality of traits concerned with specific aspects.
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.
A basic ArraySet implementation suitable for efficient add operations. Element removal could be optimized by another implementation.
The main companion object for mutable graphs.