![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include "ortools/sat/symmetry_util.h"#include <algorithm>#include <cstdint>#include <memory>#include <vector>#include "absl/container/flat_hash_set.h"#include "absl/log/check.h"#include "absl/types/span.h"#include "ortools/algorithms/dynamic_partition.h"#include "ortools/algorithms/sparse_permutation.h"#include "ortools/base/logging.h"Go to the source code of this file.
Namespaces | |
| namespace | operations_research |
| In SWIG mode, we don't want anything besides these top-level includes. | |
| namespace | operations_research::sat |
Functions | |
| std::vector< std::vector< int > > | operations_research::sat::BasicOrbitopeExtraction (absl::Span< const std::unique_ptr< SparsePermutation > > generators) |
| std::vector< int > | operations_research::sat::GetOrbits (int n, absl::Span< const std::unique_ptr< SparsePermutation > > generators) |
| std::vector< int > | operations_research::sat::GetOrbitopeOrbits (int n, absl::Span< const std::vector< int > > orbitope) |
| void | operations_research::sat::GetSchreierVectorAndOrbit (int point, absl::Span< const std::unique_ptr< SparsePermutation > > generators, std::vector< int > *schrier_vector, std::vector< int > *orbit) |
| std::vector< int > | operations_research::sat::TracePoint (int point, absl::Span< const int > schrier_vector, absl::Span< const std::unique_ptr< SparsePermutation > > generators) |
| std::unique_ptr< SparsePermutation > | operations_research::sat::CreateSparsePermutationFromProto (int n, const SparsePermutationProto &proto) |
| Creates a SparsePermutation on [0, n) from its proto representation. | |