package mutable
 Alphabetic
 Public
 All
Type Members

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 mutable graph representation.

trait
ArraySet[A] extends MSet[A] with GenericSetTemplate[A, ArraySet] with SetLike[A, ArraySet[A]] with ExtSetMethods[A]
A growable and compactable
mutable.Set
implementation based onArray
andmutable.Set
.A growable and compactable
mutable.Set
implementation based onArray
andmutable.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. 
abstract
class
BuilderImpl[N, E[X] <: EdgeLikeIn[X], CC[N, E[X] <: EdgeLikeIn[X]] <: collection.Graph[N, E[X]] with collection.GraphLike[N, E[X], CC]] extends Builder[Param[N, E], CC[N, E]]
 Attributes
 protected[scalax.collection]

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

trait
EdgeOps[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends AnyRef
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.  trait EqHash[A <: AnyRef, This <: EqHash[A, This]] extends AnyRef
 class EqHashMap[K <: AnyRef, V] extends Map[K, V] with MapLike[K, V, EqHashMap[K, V]] with EqHash[(K, V), EqHashMap[K, V]]
 class EqHashSet[A <: AnyRef] extends Set[A] with SetLike[A, EqHashSet[A]] with EqHash[A, EqHashSet[A]]

final
class
ExtBitSet extends BitSet
 Attributes
 protected[scalax.collection]
 class ExtHashSet[A] extends HashSet[A] with SetLike[A, ExtHashSet[A]] with GenericSetTemplate[A, ExtHashSet] with ExtSetMethods[A]

trait
Graph[N, E[X] <: EdgeLikeIn[X]] extends collection.Graph[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.
 class GraphBuilder[N, E[X] <: EdgeLikeIn[X], CC[N, E[X] <: EdgeLikeIn[X]] <: collection.GraphLike[N, E[X], CC] with collection.Graph[N, E[X]]] extends BuilderImpl[N, E, CC]

trait
GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends collection.GraphLike[N, E, This] with Growable[Param[N, E]] with Shrinkable[Param[N, E]] with Cloneable[Graph[N, E]] with EdgeOps[N, E, This] with Mutable
Trait with common mutable Graph methods.

final
class
SimpleArraySet[A] extends ArraySet[A] with GenericSetTemplate[A, SimpleArraySet] with SetLike[A, SimpleArraySet[A]] 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()
Value Members
 object ArraySet extends MutableSetFactory[ArraySet]
 object DefaultGraphImpl extends MutableGraphCompanion[DefaultGraphImpl] with Serializable
 object EqHash
 object EqHashMap
 object EqHashSet
 object ExtHashSet extends MutableSetFactory[ExtHashSet] with Serializable

object
Graph extends MutableGraphCompanion[Graph] with Serializable
The main companion object for mutable graphs.
 object SimpleArraySet extends MutableSetFactory[SimpleArraySet] 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
.