package mutable
- Alphabetic
- Public
- Protected
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 AddSubtract[Param[N, E], This[N, E]] with AdjacencyListBase[N, E, This]
Implements an incident list based mutable graph representation.
- 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 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]] with Growable[Param[N, E]]
- Attributes
- protected[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, This <: EqHash[A, This]] extends AnyRef
- class EqHashMap[K <: AnyRef, V] extends Map[K, V] with EqHash[(K, V), EqHashMap[K, V]]
- class EqHashSet[A <: AnyRef] extends Set[A] with EqHash[A, EqHashSet[A]]
- final class ExtBitSet extends BitSet with Compat.ExtBitSet
- Attributes
- protected[collection]
- trait Graph[N, E[+X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]
The main trait for mutable graphs bundling functionality that is not specific to graph representation.
The main trait for mutable graphs bundling functionality that is not specific to graph representation.
- 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, [X, Y[+X]]This[X, Y]] with Growable[Param[N, E]] with Shrinkable[Param[N, E]] with Cloneable[Graph[N, E]] with EdgeOps[N, E, [X, Y[+X]]This[X, Y]]
Trait with common mutable Graph methods.
- 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()
Value Members
- object ArraySet extends IterableFactory[ArraySet]
- object DefaultGraphImpl extends MutableGraphCompanion[DefaultGraphImpl] with Serializable
- object EqHash
- object EqHashMap
- object EqHashSet
- object ExtBitSet extends Serializable
- object Graph extends MutableGraphCompanion[Graph] with Serializable
The main companion object for mutable graphs.
- object SimpleArraySet extends IterableFactory[SimpleArraySet]
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
.