Type Members

1.  trait AbstractBuilder[N, E <: Edge[N]] extends Growable[N, E]
2.  trait AdjacencyListGraph[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: AdjacencyListGraph[X, Y, CC] with Graph[X, Y]] extends GraphLike[N, E, CC] with AdjacencyListBase[N, E, CC]

   Implements an incident list based mutable graph representation.

3.  trait ArraySet[A] extends AbstractSet[A] with SetOps[A, ArraySet, ArraySet[A]] with IterableFactoryDefaults[A, ArraySet] with ExtSetMethods[A]

   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.

4.  class Builder[N, E <: Edge[N], +CC[N, E <: Edge[N]] <: collection.GraphLike[N, E, CC] with AnyGraph[N, E]] extends BuilderImpl[N, E]
5.  abstract class BuilderImpl[N, E <: Edge[N]] extends AbstractBuilder[N, E]

   Attributes

   protected[collection]

6.  class DefaultGraphImpl[N, E <: Edge[N]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]

   Annotations

   @SerialVersionUID()

7.  trait EqHash[A, C <: EqHash[A, C]] extends AnyRef
8.  class EqHashMap[K <: AnyRef, V] extends Map[K, V] with EqHash[(K, V), EqHashMap[K, V]]
9.  class EqHashSet[A <: AnyRef] extends Set[A] with EqHash[A, EqHashSet[A]]
10.  final class ExtBitSet extends BitSet

    Attributes

    protected[collection]

11.  trait Graph[N, E <: Edge[N]] extends AnyGraph[N, E] with GraphLike[N, E, Graph]

    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.

    N

    the type of the nodes (vertices) in this graph.

    E

    the kind of the edges in this graph.

12.  trait GraphLike[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with Graph[X, Y]] extends collection.GraphLike[N, E, [X, Y]CC[X, Y]] with GraphOps[N, E, [X, Y]CC[X, Y]]

    Trait with common mutable Graph methods.

13.  trait GraphOps[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with Graph[X, Y]] extends Growable[N, E] with Shrinkable[N, E] with AbstractBuilder[N, E] with Cloneable[CC[N, E]]
14.  trait Growable[-N, -E <: Edge[N]] extends AnyRef
15.  trait Shrinkable[-N, -E <: Edge[N]] extends OuterElems[N, E]
16.  final class SimpleArraySet[A] extends AbstractSet[A] with ArraySet[A] with StrictOptimizedIterableOps[A, SimpleArraySet, SimpleArraySet[A]] with IterableFactoryDefaults[A, SimpleArraySet] with Serializable

    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.

    Annotations

    @SerialVersionUID()

17.  trait TypedGraphFactory[N, E <: Edge[N]] extends TypedGraphCoreFactory[N, E, Graph]