diff --git a/ortools/java/com/google/ortools/sat/CpModel.java b/ortools/java/com/google/ortools/sat/CpModel.java index d740325277..7a82d6dbe1 100644 --- a/ortools/java/com/google/ortools/sat/CpModel.java +++ b/ortools/java/com/google/ortools/sat/CpModel.java @@ -425,9 +425,9 @@ public final class CpModel { * *

Adds an empty circuit constraint. * - *

A circuit is a unique Hamiltonian path in a subgraph of the total graph. In case a node 'i' - * is not in the path, then there must be a loop arc {@code 'i -> i'} associated with a true - * literal. Otherwise this constraint will fail. + *

A circuit is a unique Hamiltonian circuit in a subgraph of the total graph. In case a node + * 'i' is not in the circuit, then there must be a loop arc {@code 'i -> i'} associated with a + * true literal. Otherwise this constraint will fail. */ public CircuitConstraint addCircuit() { return new CircuitConstraint(modelBuilder); diff --git a/ortools/sat/csharp/CpModel.cs b/ortools/sat/csharp/CpModel.cs index f0bc8b5f0d..4cc41a0923 100644 --- a/ortools/sat/csharp/CpModel.cs +++ b/ortools/sat/csharp/CpModel.cs @@ -299,9 +299,9 @@ public class CpModel * Adds and returns an empty circuit constraint. * * - * A circuit is a unique Hamiltonian path in a subgraph of the total graph. In case a node i - * is not in the path, then there must be a loop arc i -> i associated with a true - * literal. Otherwise this constraint will fail. + * A circuit is a unique Hamiltonian circuit in a subgraph of the total graph. In case + * a node i is not in the circuit, then there must be a loop arc i -> i + * associated with a true literal. Otherwise this constraint will fail. * */ public CircuitConstraint AddCircuit()