Package

scalax.collection.constrained

constraints

Permalink

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] with ConstraintHandlerMethods[N, E]

    Permalink

    Ensures that the underlying Graph is acyclic at any time.

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

    Permalink

    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] with ConstraintHandlerMethods[N, E]

    Permalink

    The empty constraint treating any addition or subtraction as valid.

Inherited from AnyRef

Inherited from Any

Ungrouped