Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::BinaryTreeNode Struct Reference

Public Attributes

absl::flat_hash_set< int > connected_components_descendants
 Contains exactly one element if occupying_box_index != -1.
 
int occupying_box_x_max
 
int occupying_box_index = -1
 -1 if not occupied.
 

Detailed Description

Each node in the tree will hold either a single box that is covering the whole interval represented by the node, or, if no such box exists, a superset of all the connected components of boxes that are overlapping the interval. It is a superset and not the exact set of connected components because we don't delete nodes that became stale, as explained in the class comment below.

Definition at line 1635 of file diffn_util.cc.

Member Data Documentation

◆ connected_components_descendants

absl::flat_hash_set<int> operations_research::sat::BinaryTreeNode::connected_components_descendants

Contains exactly one element if occupying_box_index != -1.

Definition at line 1637 of file diffn_util.cc.

◆ occupying_box_index

int operations_research::sat::BinaryTreeNode::occupying_box_index = -1

-1 if not occupied.

Definition at line 1642 of file diffn_util.cc.

◆ occupying_box_x_max

int operations_research::sat::BinaryTreeNode::occupying_box_x_max

Hold the x_max of the box that is currently occupying this node (if any) to know when it is stale.

Definition at line 1640 of file diffn_util.cc.


The documentation for this struct was generated from the following file: