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

object Acyclic extends ConstraintCompanion[Acyclic]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Acyclic
  2. ConstraintCompanion
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. class PrefixedConstraintCompanion extends ConstraintCompanion[CC]
    Attributes
    protected[constrained]
    Definition Classes
    ConstraintCompanion

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &&(that: ConstraintCompanion[Constraint]): ConstraintCompanionBinaryOp[[N, E[+X], G]Constraint[N, E, G]]

    Creates a new constraint companion of the type ConstraintCompanionBinaryOp the apply of which returns ConstraintBinaryOp with the And operator.

    Creates a new constraint companion of the type ConstraintCompanionBinaryOp the apply of which returns ConstraintBinaryOp with the And operator.

    Definition Classes
    ConstraintCompanion
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def apply[N, E[+X] <: EdgeLikeIn[X], G <: Graph[N, E]](self: G): Acyclic[N, E, G]

    Instantiates a user constraint.

    Instantiates a user constraint.

    Definition Classes
    Acyclic → ConstraintCompanion
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  11. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  16. def stringPrefix: Option[String]

    The stringPrefix of constrained Graphs using this constraint will be replaced by this string unless None.

    The stringPrefix of constrained Graphs using this constraint will be replaced by this string unless None.

    Definition Classes
    ConstraintCompanion
  17. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  18. def toString(): String
    Definition Classes
    AnyRef → Any
  19. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  20. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  21. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  22. def withStringPrefix(stringPrefix: String): PrefixedConstraintCompanion

    Sets stringPrefix of constrained Graphs using this combined constraint companion to graphStringPrefix.

    Sets stringPrefix of constrained Graphs using this combined constraint companion to graphStringPrefix.

    Definition Classes
    ConstraintCompanion
  23. def ||(that: ConstraintCompanion[Constraint]): ConstraintCompanionBinaryOp[[N, E[+X], G]Constraint[N, E, G]]

    Creates a new constraint companion of the type ConstraintCompanionBinaryOp the apply of which returns ConstraintBinaryOp with the Or operator.

    Creates a new constraint companion of the type ConstraintCompanionBinaryOp the apply of which returns ConstraintBinaryOp with the Or operator.

    Definition Classes
    ConstraintCompanion

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from ConstraintCompanion[Acyclic]

Inherited from AnyRef

Inherited from Any

Ungrouped