[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["The `DisjunctiveEdgeFinding` class in C++ is used for scheduling and constraint satisfaction problems, likely related to task sequencing and resource allocation."],["It offers methods like `Propagate` for constraint propagation and `RegisterWith` for integrating with a literal watcher, suggesting its role in a constraint solver system."],["Initialization involves specifying time direction and a scheduling constraint helper, indicating customization for specific problem setups."]]],["The `DisjunctiveEdgeFinding` class in C++ has methods for constraint propagation and registration. The constructor `DisjunctiveEdgeFinding` takes a boolean `time_direction` and a `SchedulingConstraintHelper` pointer. The `Propagate` method performs constraint propagation and returns a boolean. The `RegisterWith` method registers the class with a `GenericLiteralWatcher` and returns an integer. These are the key methods to use to use the class.\n"]]
