Packages

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

    Traits enabling to implement constraints and use constrained graphs.

    Traits enabling to implement constraints and use constrained graphs.

    Graphs may be constrained dynamically or statically.

    Dynamically constrained means that a constraint is bound to a constrained Graph instance at initialization time. The constrained Graph will then delegate all calls to the methods of ConstraintMethods and ConstraintHandlerMethods to the corresponding methods of the constraint bound to it. The immutable and mutable factories Graph in this package yield dynamically constrained graphs.

    To make use of dynamically constrained graphs you may make use of the predefined constraints or provide an own implementation of Constraint along with its companion object. To initialize a graph with one or several combined constraints just call the graph factory methods of the constraint package passing.

    Statically constrained means that the graph class directly implements the methods declared in ConstraintMethods.

    Definition Classes
    collection
  • package config
    Definition Classes
    constrained
  • package constraints

    Predefined constraints that may be passed to constrained Graphs.

    Predefined constraints that may be passed to constrained Graphs.

    Definition Classes
    constrained
  • package generic
    Definition Classes
    constrained
  • package immutable
    Definition Classes
    constrained
  • package mutable

    Mutable constrained graph templates.

    Mutable constrained graph templates.

    Definition Classes
    constrained
  • AdjacencyListGraph
  • CompanionAlias
  • DAG
  • DefaultGraphImpl
  • Forest
  • Graph
  • GraphBuilder
  • GraphLike
  • GraphOps
  • Tree
  • UserConstrainedGraphImpl

package mutable

Mutable constrained graph templates.

Linear Supertypes
AnyRef, Any
Content Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. mutable
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
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 mutable.AdjacencyListGraph[N, E, This] with GraphLike[N, E, This]

    Implements an adjacency list based graph representation.

    Implements an adjacency list based graph representation.

    An adjacency list based representation speeds up traversing a graph along its paths by storing the list of connecting edges to each node.

  2. abstract class CompanionAlias[E[+X] <: EdgeLikeIn[X]] extends GraphConstrainedCompanionAlias[Graph, E]

    Enables to quickly assemble mutable constrained graph companion modules.

    Enables to quickly assemble mutable constrained graph companion modules. Example: {{ import scalax.collection.constrained.mutable.CompanionAlias import scalax.collection.constrained.constraints.Acyclic

    object DAG extends CompanionAlias[DiEdge](Acyclic withStringPrefix "DAG") }}

  3. type DAG[N] = Graph[N, DiEdge]

    Mutable directed acyclic Graph.

  4. abstract class DefaultGraphImpl[N, E[+X] <: EdgeLikeIn[X]] extends Graph[N, E] with AdjacencyListGraph[N, E, DefaultGraphImpl] with GraphTraversalImpl[N, E]
  5. type Forest[N] = Graph[N, UnDiEdge]

    Mutable undirected acyclic Graph.

  6. trait Graph[N, E[+X] <: EdgeLikeIn[X]] extends mutable.Graph[N, E] with constrained.Graph[N, E] with GraphLike[N, E, Graph]
  7. class GraphBuilder[N, E[+X] <: EdgeLikeIn[X], GC[N, E[+X] <: EdgeLikeIn[X]] <: constrained.Graph[N, E[X]] with constrained.GraphLike[N, E[X], GC]] extends BuilderImpl[N, E, GC]
  8. trait GraphLike[N, E[+X] <: EdgeLikeIn[X], +This[X, Y[+X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Graph[X, Y[X]]] extends mutable.GraphLike[N, E, [X, Y[+X]]This[X, Y]] with constrained.GraphLike[N, E, [X, Y[+X]]This[X, Y]] with GraphOps[N, E, [X, Y[+X]]This[X, Y]] with Growable[Param[N, E]] with Shrinkable[Param[N, E]] with Cloneable[This[N, E]]
  9. trait GraphOps[N, E[+X] <: EdgeLikeIn[X], +This[X, Y[+X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Set[Param[X, Y[X]]] with Graph[X, Y[X]]] extends AnyRef
  10. type Tree[N] = Graph[N, UnDiEdge]

    Mutable undirected connected acyclic Graph.

  11. class UserConstrainedGraphImpl[N, E[+X] <: EdgeLikeIn[X]] extends DefaultGraphImpl[N, E] with UserConstrainedGraph[N, E, DefaultGraphImpl[N, E]]
    Annotations
    @SerialVersionUID()

Value Members

  1. object DAG extends CompanionAlias[DiEdge]

    Companion module for mutable directed acyclic Graph.

  2. object DefaultGraphImpl extends MutableGraphCompanion[DefaultGraphImpl] with Serializable
  3. object Forest extends CompanionAlias[UnDiEdge]

    Companion module for mutable undirected acyclic Graph.

  4. object Graph extends MutableGraphCompanion[Graph] with Serializable
  5. object Tree extends CompanionAlias[UnDiEdge]

    Companion module for mutable undirected connected acyclic Graph.

Inherited from AnyRef

Inherited from Any

Ungrouped