immutable

Type Members

1. trait AdjacencyListBase[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Set[Param[X, Y[X]]] with collection.Graph[X, Y[X]]] extends GraphLike[N, E, This]

   

   Implementation of an incident list based graph representation.

   Implementation of an incident list based graph representation. This trait is common to both the immutable and mutable variants. An incidence list based representation speeds up traversing the graph along its paths by storing the list of connecting edges at each node.

2. trait AdjacencyListGraph[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: AdjacencyListGraph[X, Y[X], This] with Graph[X, Y[X]]] extends GraphLike[N, E, This] with AdjacencyListBase[N, E, This]

   

   Implements an incident list based immutable graph representation.

3. class DefaultGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]

   

   Annotations

   @SerialVersionUID()

4. final class EqSet[K <: AnyRef] extends Set[K]

   

   Wrapper class mimicking a scala.collection.immutable.Set without copying the contents of the underlying EqHashMap.

5. trait Graph[N, E[X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]

   

6. class SortedArraySet[A] extends SortedSet[A] with SortedSetLike[A, SortedArraySet[A]] with Serializable

   

   Annotations

   @SerialVersionUID()