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
  • Acyclic
  • Connected
  • NoneConstraint
  • package generic
    Definition Classes
    constrained
  • package immutable
    Definition Classes
    constrained
  • package mutable

    Mutable constrained graph templates.

    Mutable constrained graph templates.

    Definition Classes
    constrained

package constraints

Predefined constraints that may be passed to constrained Graphs.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. constraints
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class Acyclic [N, E[X] <: EdgeLikeIn[X]] extends Constraint[N, E]

    Ensures that the underlying Graph is acyclic at any time.

  2. class Connected [N, E[X] <: EdgeLikeIn[X]] extends Constraint[N, E]

    Ensures that the underlying Graph is connected if it is undirected or weakly connected if it is directed.

  3. class NoneConstraint [N, E[X] <: EdgeLikeIn[X]] extends Constraint[N, E]

    The empty constraint treating any addition or subtraction as valid.

Inherited from AnyRef

Inherited from Any

Ungrouped