com.google.ortools.sat

Interface SymmetryProtoOrBuilder

All Superinterfaces:

com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder

All Known Implementing Classes:

SymmetryProto, SymmetryProto.Builder

public interface SymmetryProtoOrBuilder
extends com.google.protobuf.MessageOrBuilder

Method Summary

Modifier and Type	Method and Description
DenseMatrixProto	getOrbitopes(int index) An orbitope is a special symmetry structure of the solution space.
int	getOrbitopesCount() An orbitope is a special symmetry structure of the solution space.
java.util.List<DenseMatrixProto>	getOrbitopesList() An orbitope is a special symmetry structure of the solution space.
DenseMatrixProtoOrBuilder	getOrbitopesOrBuilder(int index) An orbitope is a special symmetry structure of the solution space.
java.util.List<? extends DenseMatrixProtoOrBuilder>	getOrbitopesOrBuilderList() An orbitope is a special symmetry structure of the solution space.
SparsePermutationProto	getPermutations(int index) A list of variable indices permutations that leave the feasible space of solution invariant.
int	getPermutationsCount() A list of variable indices permutations that leave the feasible space of solution invariant.
java.util.List<SparsePermutationProto>	getPermutationsList() A list of variable indices permutations that leave the feasible space of solution invariant.
SparsePermutationProtoOrBuilder	getPermutationsOrBuilder(int index) A list of variable indices permutations that leave the feasible space of solution invariant.
java.util.List<? extends SparsePermutationProtoOrBuilder>	getPermutationsOrBuilderList() A list of variable indices permutations that leave the feasible space of solution invariant.

Methods inherited from interface com.google.protobuf.MessageOrBuilder

findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof

Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

isInitialized

Method Detail

getPermutationsList

java.util.List<SparsePermutationProto> getPermutationsList()

 A list of variable indices permutations that leave the feasible space of
 solution invariant. Usually, we only encode a set of generators of the
 group.
 

repeated .operations_research.sat.SparsePermutationProto permutations = 1;

getPermutations

SparsePermutationProto getPermutations(int index)

 A list of variable indices permutations that leave the feasible space of
 solution invariant. Usually, we only encode a set of generators of the
 group.
 

repeated .operations_research.sat.SparsePermutationProto permutations = 1;

getPermutationsCount

int getPermutationsCount()

 A list of variable indices permutations that leave the feasible space of
 solution invariant. Usually, we only encode a set of generators of the
 group.
 

repeated .operations_research.sat.SparsePermutationProto permutations = 1;

getPermutationsOrBuilderList

java.util.List<? extends SparsePermutationProtoOrBuilder> getPermutationsOrBuilderList()

 A list of variable indices permutations that leave the feasible space of
 solution invariant. Usually, we only encode a set of generators of the
 group.
 

repeated .operations_research.sat.SparsePermutationProto permutations = 1;

getPermutationsOrBuilder

SparsePermutationProtoOrBuilder getPermutationsOrBuilder(int index)

 A list of variable indices permutations that leave the feasible space of
 solution invariant. Usually, we only encode a set of generators of the
 group.
 

repeated .operations_research.sat.SparsePermutationProto permutations = 1;

getOrbitopesList

java.util.List<DenseMatrixProto> getOrbitopesList()

 An orbitope is a special symmetry structure of the solution space. If the
 variable indices are arranged in a matrix (with no duplicates), then any
 permutation of the columns will be a valid permutation of the feasible
 space.

 This arise quite often. The typical example is a graph coloring problem
 where for each node i, you have j booleans to indicate its color. If the
 variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
 permutations leave the problem invariant.
 

repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;

getOrbitopes

DenseMatrixProto getOrbitopes(int index)

 An orbitope is a special symmetry structure of the solution space. If the
 variable indices are arranged in a matrix (with no duplicates), then any
 permutation of the columns will be a valid permutation of the feasible
 space.

 This arise quite often. The typical example is a graph coloring problem
 where for each node i, you have j booleans to indicate its color. If the
 variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
 permutations leave the problem invariant.
 

repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;

getOrbitopesCount

int getOrbitopesCount()

 An orbitope is a special symmetry structure of the solution space. If the
 variable indices are arranged in a matrix (with no duplicates), then any
 permutation of the columns will be a valid permutation of the feasible
 space.

 This arise quite often. The typical example is a graph coloring problem
 where for each node i, you have j booleans to indicate its color. If the
 variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
 permutations leave the problem invariant.
 

repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;

getOrbitopesOrBuilderList

java.util.List<? extends DenseMatrixProtoOrBuilder> getOrbitopesOrBuilderList()

 An orbitope is a special symmetry structure of the solution space. If the
 variable indices are arranged in a matrix (with no duplicates), then any
 permutation of the columns will be a valid permutation of the feasible
 space.

 This arise quite often. The typical example is a graph coloring problem
 where for each node i, you have j booleans to indicate its color. If the
 variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
 permutations leave the problem invariant.
 

repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;

getOrbitopesOrBuilder

DenseMatrixProtoOrBuilder getOrbitopesOrBuilder(int index)

 An orbitope is a special symmetry structure of the solution space. If the
 variable indices are arranged in a matrix (with no duplicates), then any
 permutation of the columns will be a valid permutation of the feasible
 space.

 This arise quite often. The typical example is a graph coloring problem
 where for each node i, you have j booleans to indicate its color. If the
 variables color_of_i_is_j are arranged in a matrix[i][j], then any columns
 permutations leave the problem invariant.
 

repeated .operations_research.sat.DenseMatrixProto orbitopes = 2;