1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
#include <cassert>
#include <vector>
#include "utils.hh"
/*
Copyright (c) 2003-2015 Tommi Junttila
Released under the GNU Lesser General Public License version 3.
This file is part of bliss.
bliss is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, version 3 of the License.
bliss is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with bliss. If not, see <http://www.gnu.org/licenses/>.
*/
namespace bliss {
void
print_permutation(FILE* const fp,
const unsigned int N,
const unsigned int* perm,
const unsigned int offset)
{
assert(N > 0);
assert(perm);
for(unsigned int i = 0; i < N; i++) {
unsigned int j = perm[i];
if(j == i)
continue;
bool is_first = true;
while(j != i) {
if(j < i) {
is_first = false;
break;
}
j = perm[j];
}
if(!is_first)
continue;
fprintf(fp, "(%u,", i+offset);
j = perm[i];
while(j != i) {
fprintf(fp, "%u", j+offset);
j = perm[j];
if(j != i)
fprintf(fp, ",");
}
fprintf(fp, ")");
}
}
void
print_permutation(FILE* const fp,
const std::vector<unsigned int>& perm,
const unsigned int offset)
{
const unsigned int N = perm.size();
for(unsigned int i = 0; i < N; i++) {
unsigned int j = perm[i];
if(j == i)
continue;
bool is_first = true;
while(j != i) {
if(j < i) {
is_first = false;
break;
}
j = perm[j];
}
if(!is_first)
continue;
fprintf(fp, "(%u,", i+offset);
j = perm[i];
while(j != i) {
fprintf(fp, "%u", j+offset);
j = perm[j];
if(j != i)
fprintf(fp, ",");
}
fprintf(fp, ")");
}
}
bool
is_permutation(const unsigned int N, const unsigned int* perm)
{
if(N == 0)
return true;
std::vector<bool> m(N, false);
for(unsigned int i = 0; i < N; i++) {
if(perm[i] >= N) return false;
if(m[perm[i]]) return false;
m[perm[i]] = true;
}
return true;
}
bool
is_permutation(const std::vector<unsigned int>& perm)
{
const unsigned int N = perm.size();
if(N == 0)
return true;
std::vector<bool> m(N, false);
for(unsigned int i = 0; i < N; i++) {
if(perm[i] >= N) return false;
if(m[perm[i]]) return false;
m[perm[i]] = true;
}
return true;
}
} // namespace bliss
|
