package immutable
 Alphabetic
 Public
 All
Type Members

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.

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.

class
DefaultGraphImpl[N, E[X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]
 Annotations
 @SerialVersionUID()

final
class
EqSet[K <: AnyRef] extends Set[K]
Wrapper class mimicking a
scala.collection.immutable.Set
without copying the contents of the underlyingEqHashMap
.  trait Graph[N, E[X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]

class
SortedArraySet[A] extends SortedSet[A] with SortedSetLike[A, SortedArraySet[A]] with Serializable
 Annotations
 @SerialVersionUID()
Value Members
 object DefaultGraphImpl extends ImmutableGraphCompanion[DefaultGraphImpl] with Serializable
 object Graph extends ImmutableGraphCompanion[Graph] with Serializable
 object SortedArraySet extends SortedSetFactory[SortedArraySet] with Serializable
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.