Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class NoCyclePropagator
Note: This documentation is automatically generated.
Enforce the fact that there is no cycle in the given directed graph.
| Method |
IncrementalPropagate | Return type: bool Arguments: const std::vector<int>& watch_indices |
NoCyclePropagator | Arguments: int num_nodes, const std::vector<int>& tails,
const std::vector<int>& heads,
const std::vector<Literal>& literals, Model* model |
Propagate | Return type: bool |
SetLevel | Return type: void Arguments: int level |
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The `NoCyclePropagator` class in C++ enforces the absence of cycles in a directed graph. It utilizes methods like `IncrementalPropagate` and `Propagate` to check for cycle existence, returning a boolean result. `SetLevel` manages the propagation level. The constructor, `NoCyclePropagator`, takes in parameters like the number of nodes, tails, heads, literals, and a model, to setup the problem. The method takes watch indices for the `IncrementalPropagate`.\n"],null,[]]
