Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <disjunctive.h>
Public Member Functions | |
DisjunctiveEdgeFinding (bool time_direction, SchedulingConstraintHelper *helper, Model *model=nullptr) | |
bool | Propagate () final |
int | RegisterWith (GenericLiteralWatcher *watcher) |
Public Member Functions inherited from operations_research::sat::PropagatorInterface | |
PropagatorInterface ()=default | |
virtual | ~PropagatorInterface ()=default |
virtual bool | IncrementalPropagate (const std::vector< int > &) |
Definition at line 315 of file disjunctive.h.
|
inline |
Definition at line 317 of file disjunctive.h.
|
finalvirtual |
This will be called after one or more literals that are watched by this propagator changed. It will also always be called on the first propagation cycle after registration.
We need at least 3 tasks for the edge-finding to be different from detectable precedences.
Start of the next window.
Implements operations_research::sat::PropagatorInterface.
Definition at line 1529 of file disjunctive.cc.
int operations_research::sat::DisjunctiveEdgeFinding::RegisterWith | ( | GenericLiteralWatcher * | watcher | ) |
Definition at line 1805 of file disjunctive.cc.