|
| 1 | +// Copyright 2010-2024 Google LLC |
| 2 | +// Licensed under the Apache License, Version 2.0 (the "License"); |
| 3 | +// you may not use this file except in compliance with the License. |
| 4 | +// You may obtain a copy of the License at |
| 5 | +// |
| 6 | +// http://www.apache.org/licenses/LICENSE-2.0 |
| 7 | +// |
| 8 | +// Unless required by applicable law or agreed to in writing, software |
| 9 | +// distributed under the License is distributed on an "AS IS" BASIS, |
| 10 | +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 11 | +// See the License for the specific language governing permissions and |
| 12 | +// limitations under the License. |
| 13 | + |
| 14 | +#include "ortools/sat/symmetry_util.h" |
| 15 | + |
| 16 | +#include <memory> |
| 17 | +#include <vector> |
| 18 | + |
| 19 | +#include "gtest/gtest.h" |
| 20 | +#include "ortools/algorithms/sparse_permutation.h" |
| 21 | +#include "ortools/base/gmock.h" |
| 22 | + |
| 23 | +namespace operations_research { |
| 24 | +namespace sat { |
| 25 | +namespace { |
| 26 | + |
| 27 | +using ::testing::ElementsAre; |
| 28 | + |
| 29 | +TEST(GetOrbitsTest, BasicExample) { |
| 30 | + const int n = 10; |
| 31 | + std::vector<std::unique_ptr<SparsePermutation>> generators; |
| 32 | + generators.push_back(std::make_unique<SparsePermutation>(n)); |
| 33 | + generators[0]->AddToCurrentCycle(0); |
| 34 | + generators[0]->AddToCurrentCycle(1); |
| 35 | + generators[0]->AddToCurrentCycle(2); |
| 36 | + generators[0]->CloseCurrentCycle(); |
| 37 | + generators[0]->AddToCurrentCycle(7); |
| 38 | + generators[0]->AddToCurrentCycle(8); |
| 39 | + generators[0]->CloseCurrentCycle(); |
| 40 | + |
| 41 | + generators.push_back(std::make_unique<SparsePermutation>(n)); |
| 42 | + generators[1]->AddToCurrentCycle(3); |
| 43 | + generators[1]->AddToCurrentCycle(2); |
| 44 | + generators[1]->AddToCurrentCycle(7); |
| 45 | + generators[1]->CloseCurrentCycle(); |
| 46 | + const std::vector<int> orbits = GetOrbits(n, generators); |
| 47 | + for (const int i : std::vector<int>{0, 1, 2, 3, 7, 8}) { |
| 48 | + EXPECT_EQ(orbits[i], 0); |
| 49 | + } |
| 50 | + for (const int i : std::vector<int>{4, 5, 6, 9}) { |
| 51 | + EXPECT_EQ(orbits[i], -1); |
| 52 | + } |
| 53 | +} |
| 54 | + |
| 55 | +// Recover for generators (in a particular form) |
| 56 | +// [0, 1, 2] |
| 57 | +// [4, 5, 3] |
| 58 | +// [8, 7, 6] |
| 59 | +TEST(BasicOrbitopeExtractionTest, BasicExample) { |
| 60 | + const int n = 10; |
| 61 | + std::vector<std::unique_ptr<SparsePermutation>> generators; |
| 62 | + |
| 63 | + generators.push_back(std::make_unique<SparsePermutation>(n)); |
| 64 | + generators[0]->AddToCurrentCycle(0); |
| 65 | + generators[0]->AddToCurrentCycle(1); |
| 66 | + generators[0]->CloseCurrentCycle(); |
| 67 | + generators[0]->AddToCurrentCycle(4); |
| 68 | + generators[0]->AddToCurrentCycle(5); |
| 69 | + generators[0]->CloseCurrentCycle(); |
| 70 | + generators[0]->AddToCurrentCycle(8); |
| 71 | + generators[0]->AddToCurrentCycle(7); |
| 72 | + generators[0]->CloseCurrentCycle(); |
| 73 | + |
| 74 | + generators.push_back(std::make_unique<SparsePermutation>(n)); |
| 75 | + generators[1]->AddToCurrentCycle(2); |
| 76 | + generators[1]->AddToCurrentCycle(1); |
| 77 | + generators[1]->CloseCurrentCycle(); |
| 78 | + generators[1]->AddToCurrentCycle(5); |
| 79 | + generators[1]->AddToCurrentCycle(3); |
| 80 | + generators[1]->CloseCurrentCycle(); |
| 81 | + generators[1]->AddToCurrentCycle(6); |
| 82 | + generators[1]->AddToCurrentCycle(7); |
| 83 | + generators[1]->CloseCurrentCycle(); |
| 84 | + |
| 85 | + const std::vector<std::vector<int>> orbitope = |
| 86 | + BasicOrbitopeExtraction(generators); |
| 87 | + ASSERT_EQ(orbitope.size(), 3); |
| 88 | + EXPECT_THAT(orbitope[0], ElementsAre(0, 1, 2)); |
| 89 | + EXPECT_THAT(orbitope[1], ElementsAre(4, 5, 3)); |
| 90 | + EXPECT_THAT(orbitope[2], ElementsAre(8, 7, 6)); |
| 91 | +} |
| 92 | + |
| 93 | +// This one is trickier and is not an orbitope because 8 appear twice. So it |
| 94 | +// would be incorrect to "grow" the first two columns with the 3rd one. |
| 95 | +// [0, 1, 2] |
| 96 | +// [4, 5, 8] |
| 97 | +// [8, 7, 9] |
| 98 | +TEST(BasicOrbitopeExtractionTest, NotAnOrbitopeBecauseOfDuplicates) { |
| 99 | + const int n = 10; |
| 100 | + std::vector<std::unique_ptr<SparsePermutation>> generators; |
| 101 | + |
| 102 | + generators.push_back(std::make_unique<SparsePermutation>(n)); |
| 103 | + generators[0]->AddToCurrentCycle(0); |
| 104 | + generators[0]->AddToCurrentCycle(1); |
| 105 | + generators[0]->CloseCurrentCycle(); |
| 106 | + generators[0]->AddToCurrentCycle(4); |
| 107 | + generators[0]->AddToCurrentCycle(5); |
| 108 | + generators[0]->CloseCurrentCycle(); |
| 109 | + generators[0]->AddToCurrentCycle(8); |
| 110 | + generators[0]->AddToCurrentCycle(7); |
| 111 | + generators[0]->CloseCurrentCycle(); |
| 112 | + |
| 113 | + generators.push_back(std::make_unique<SparsePermutation>(n)); |
| 114 | + generators[1]->AddToCurrentCycle(1); |
| 115 | + generators[1]->AddToCurrentCycle(2); |
| 116 | + generators[1]->CloseCurrentCycle(); |
| 117 | + generators[1]->AddToCurrentCycle(5); |
| 118 | + generators[1]->AddToCurrentCycle(8); |
| 119 | + generators[1]->CloseCurrentCycle(); |
| 120 | + generators[1]->AddToCurrentCycle(6); |
| 121 | + generators[1]->AddToCurrentCycle(9); |
| 122 | + generators[1]->CloseCurrentCycle(); |
| 123 | + |
| 124 | + const std::vector<std::vector<int>> orbitope = |
| 125 | + BasicOrbitopeExtraction(generators); |
| 126 | + ASSERT_EQ(orbitope.size(), 3); |
| 127 | + EXPECT_THAT(orbitope[0], ElementsAre(0, 1)); |
| 128 | + EXPECT_THAT(orbitope[1], ElementsAre(4, 5)); |
| 129 | + EXPECT_THAT(orbitope[2], ElementsAre(8, 7)); |
| 130 | +} |
| 131 | + |
| 132 | +} // namespace |
| 133 | +} // namespace sat |
| 134 | +} // namespace operations_research |
0 commit comments