Type Members

1.  trait AdjacencyListBase[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with AnyGraph[X, Y]] extends GraphLike[N, E, CC]

   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 <: Edge[N], +CC[X, Y <: Edge[X]] <: AdjacencyListGraph[X, Y, CC] with Graph[X, Y]] extends GraphLike[N, E, CC] with GraphOps[N, E, CC] with AdjacencyListBase[N, E, CC]

   Implements an incident list based immutable graph representation.

3.  class DefaultGraphImpl[N, E <: Edge[N]] 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 <: Edge[N]] extends AnyGraph[N, E] with GraphLike[N, E, Graph] with GraphOps[N, E, Graph]
6.  trait GraphOps[N, E <: Edge[N], +CC[X, Y <: Edge[X]] <: GraphLike[X, Y, CC] with Graph[X, Y]] extends AnyRef

   Immutable graph only operations.

   Immutable graph only operations.

   $define edgesOnlyUseCase Provided for the use case when you don't need to pass any isolated node.

7.  class SortedArraySet[A] extends AbstractSet[A] with SortedSet[A] with SortedSetOps[A, SortedArraySet, SortedArraySet[A]] with StrictOptimizedSortedSetOps[A, SortedArraySet, SortedArraySet[A]] with SortedSetFactoryDefaults[A, SortedArraySet, Set] with DefaultSerializable

   Annotations

   @SerialVersionUID()

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