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
  • AdjacencyListBase
  • AdjacencyListGraph
  • DefaultGraphImpl
  • EqSet
  • Graph
  • SortedArraySet
  • package interfaces
    Definition Classes
    collection
  • package mutable
    Definition Classes
    collection
p

scalax.collection

immutable

package immutable

Ordering
  1. Alphabetic
Visibility
  1. Public
  2. All

Type Members

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

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

  3. class DefaultGraphImpl [N, E[X] <: EdgeLikeIn[X]] 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[X] <: EdgeLikeIn[X]] extends collection.Graph[N, E] with GraphLike[N, E, Graph]
  6. class SortedArraySet [A] extends SortedSet[A] with SortedSetLike[A, SortedArraySet[A]] with Serializable
    Annotations
    @SerialVersionUID()

Ungrouped