edge2leaf
edge2leaf: Map<string, Set<number>> = ...
leaves
leaves: Set<number> = ...
leaves_equal
leaves_equal: Set<string> = ...
leaves_same
leaves_same: Set<string> = ...
leaves_same_range
leaves_same_range: Set<string> = ...
leaves_sub
leaves_sub: Set<string> = ...
node2leaf
node2leaf: Map<number, Set<toLeaf>> = ...
roots
roots: Set<number> = ...
solution_range
solution_range: Map<number, Type[]> = ... solutions
solutions: Map<number, Type> = ... solutions_collection
solutions_collection: Map<number, Type>[] = [] sub
sub: Set<string> = ...
super
super: Set<string> = ...
A directed acyclic graph that stores the constraints between nodes.