A directed acyclic graph that stores the constraints between nodes.

Hierarchy (View Summary)

Constructors

Properties

dag_nodes: Map<number, ConstraintNode> = ...
edge2leaf: Map<string, Set<number>> = ...
leaves: Set<number> = ...
leaves_equal: Set<string> = ...
leaves_same: Set<string> = ...
leaves_same_range: Set<string> = ...
leaves_sub: Set<string> = ...
name: string
node2leaf: Map<number, Set<toLeaf>> = ...
roots: Set<number> = ...
solution_range: Map<number, Type[]> = ...
solutions: Map<number, Type> = ...
solutions_collection: Map<number, Type>[] = []
sub: Set<string> = ...
super: Set<string> = ...

Methods

  • Parameters

    • dominator_id: number
    • dominatee_id: number
    • Optionalrank: "sub" | "super"

    Returns void

  • Parameters

    • dominator_id: number
    • dominatee_id: number
    • direction: "inside_out" | "outside_in" | "bidirectional" = "bidirectional"

    Returns void