Packages

  • package root

    Welcome to the Graph for Scala API reference.

    Welcome to the Graph for Scala API reference. Some suggested navigation entry points:

    Definition Classes
    root
  • package scalax
    Definition Classes
    root
  • package collection

    Contains the base traits and objects needed to use Graph for Scala.

    Contains the base traits and objects needed to use Graph for Scala.

    See also the Graph for Scala Core User Guide.

    Definition Classes
    scalax
  • package config
    Definition Classes
    collection
  • package edge

    Predefined edges.

    Predefined edges.

    While basic edge types are defined in the object GraphEdge, the predefined edges in this package cover the following categories (prefixes, shortcuts):

    weighted (W, %), key-weighted (Wk, %#), labeled (L, +), key-labeled (Lk, +#), weighted and labeled (WL, %+), key-weighted and labeled (WkL, %#+), weighted and key-labeled (WLk, %+#) and key-weighted and key-labeled (WkLk, %#+#).

    These predefined edges provide alternatives for any edge extension taking the burden from the user to implement his/her custom edge class - but baring the disadvantage that user edge attributes must be part of a label class as opposed to being part of the edge class directly. It may also serve as a source for looking up how to implement custom edge classes.

    Definition Classes
    collection
  • package generator

    This package helps you to create random graphs with predefined metrics.

    This package helps you to create random graphs with predefined metrics. It is not only possible to create random graph instances but also Scalacheck generators.

    Definition Classes
    collection
  • package generic
    Definition Classes
    collection
  • package immutable
    Definition Classes
    collection
  • package mutable
    Definition Classes
    collection
  • AdjacencyListGraph
  • ArraySet
  • BuilderImpl
  • DefaultGraphImpl
  • EdgeOps
  • EqHash
  • EqHashMap
  • EqHashSet
  • ExtBitSet
  • Graph
  • GraphBuilder
  • GraphLike
  • SimpleArraySet

package mutable

Content Hierarchy
Ordering
  1. Alphabetic
Visibility
  1. Public
  2. Protected

Type Members

  1. 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.

  2. 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 on Array and mutable.Set.

    A growable and compactable mutable.Set implementation based on Array and mutable.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.

  3. 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]
  4. class DefaultGraphImpl[N, E[+X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]
    Annotations
    @SerialVersionUID()
  5. 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.

  6. trait EqHash[A, This <: EqHash[A, This]] extends AnyRef
  7. class EqHashMap[K <: AnyRef, V] extends Map[K, V] with EqHash[(K, V), EqHashMap[K, V]]
  8. class EqHashSet[A <: AnyRef] extends Set[A] with EqHash[A, EqHashSet[A]]
  9. final class ExtBitSet extends BitSet with Compat.ExtBitSet
    Attributes
    protected[collection]
  10. 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.

  11. 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]
  12. 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.

  13. 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

  1. object ArraySet extends IterableFactory[ArraySet]
  2. object DefaultGraphImpl extends MutableGraphCompanion[DefaultGraphImpl] with Serializable
  3. object EqHash
  4. object EqHashMap
  5. object EqHashSet
  6. object ExtBitSet extends Serializable
  7. object Graph extends MutableGraphCompanion[Graph] with Serializable

    The main companion object for mutable graphs.

  8. object SimpleArraySet extends IterableFactory[SimpleArraySet]

Ungrouped