-
Notifications
You must be signed in to change notification settings - Fork 0
/
lab01_IS.cpp
245 lines (207 loc) · 7.39 KB
/
lab01_IS.cpp
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
using namespace std;
//Vector printing
void show(vector<int> &v){
for(int i = 0; i < v.size(); i++)
cout << v[i] << " "<< endl;
}
//Matrix printing
void show(vector<vector<int>> &matrix){
for(int i = 0; i < matrix.size(); i++){
for(int j = 0; j < matrix[i].size(); j++)
cout << matrix[i][j] << " " << endl;
}
cout << endl;
}
//Output of state vectors
void show_state(const vector<vector<int>> &sm){
for(int i = 0; i < sm.size(); i++){
cout << i << " State" << ": "; // state number
for(int j = 0; j < sm[i].size(); j++)
cout << sm[i][j] <<" "<< endl;
}
cout << endl;
}
// Output of all vectors of length N
void all_Nvectors(int n, vector<vector<int>> &v){
for(int i = 0; i < pow(2, n); i++){
vector<int> Vec; // we create a vector
int k = i;
while(k > 0){
Vec.push_back(k % 2); //convert a decimal number to binary
k /= 2;
}
if(Vec.size() < n){
int t = n - Vec.size(); //how many zero should
for(int j = 0; j < t; j++)
Vec.push_back(0);
}
reverse(Vec.begin(), Vec.end()); //turning to line over
v.push_back(Vec);
}
}
//Boolean operation OR function description:
bool Or(int n, int i, vector<int> &v0, vector<vector<int>> &sv){ //we pass the size of the vector, the line number,
//the initial vector and the connection matrix
bool boolean = false; //for all subsequent Boolean operations, similar arguments
for(int j = 0; j < n; j++){
if(sv[i][j] == 1){
if(v0[j] == 1){
return true;
}
else
boolean = false;
}
}
return boolean; // returning value
}
//boolean operation _OR function description:
bool _Or(int n, int i, vector<int> &v0, vector<vector<int>> &sv){
bool boolean = false;
for(int j = 0; j < n; j++){
if(sv[i][j] == 1){
if(v0[j] == 0){
return true;
}
else
boolean = false;
}
}
return boolean;
}
//Boolean operation AND function description:
bool And(int n, int i, vector<int> &v0, vector<vector<int>> &sv){
bool boolean = false;
for(int j = 0; j < n; j++){
if(sv[i][j] == 1){
if(v0[j] == 1){
boolean = true;
}
else{
return false;
}
}
}
return boolean;
}
//boolean operation _AND function description:
bool _And(int n, int i, vector<int> &v0, vector<vector<int>> &sv){
bool boolean = false;
for(int j = 0; j < n; j++){
if(sv[j][i] == 1){
if(v0[i] == 0){
boolean = true;
}
else
return false;
}
}
return boolean;
}
int main(){
srand(time(NULL));
int n, k;
cout << "Enter N" << endl ;
cin >> n;
cout << "Enter K" << endl ;
cin >> k;
int L = 0; //initialize the length L to zero
vector<int> v0(n,0); // initial vector
vector<vector<int>> mv; //vectors matrix
vector<vector<int>> sv(n,vector<int>(n,0)); //connection vector
vector<vector<int>> attractors; //attractor matrix
vector<vector<int>> all_attractors; //matrix of all attractors
vector<int> l;
cout << endl ;
cout << "All possible input vectors of a given length N:" << endl ;
all_Nvectors(n,mv); // generating of all these possible vectors using the function we wrote
show(mv); //vectors printing
cout << "Connected matrix:\n";
//generating a communication matrix
for(int i = 0; i < n; i++){
for(int j = 0; j < k; j++){ //there should be K units in each line
int k = i;
while(k == i || sv[i][k] == 1){ //it is important to check that the element does not enter itself (the main diagonal)
k = rand()%n;
}
sv[i][k]=1; //we arrange the ones
}
}
show(sv); //printing the communication matrix
vector<vector<int>> matrix; //creating a matrix of states mmatrix
bool checking = true, pr1=true;
matrix.push_back(v0); //addition of initial vector
for(int var = 0; var < sv.size(); var++){
v0 = sv[var];
vector<vector<int>> mat;
mat.push_back(v0);
bool checking = true;
bool pr = true;
while(checking){
vector<int> v1(n,0); //last vector
for(int i = 0; i < n; i++){
switch(i % 4){ //we arrange Boolean operators: we apply cases depending on the position of the element
case 0:
for(int i = 0; i < n; i++){
v1[i] = Or(n, i, v0, sv); //calling a function of the corresponding Boolean operator
}
break;
case 1:
for(int i = 0; i < n; i++){
v1[i] = And(n, i, v0, sv);
}
break;
case 2:
for(int i = 0; i < n; i++){
v1[i] = _Or(n, i, v0, sv);
}
break;
case 3:
for(int i = 0; i < n; i++){
v1[i] = _And(n, i, v0, sv);
}
break;
}
} //the arrangement of Boolean operators is over
v0 = v1; //now the subsequent vector is the initial vector
for(int i = 0; i < mat.size(); i++){ //attractors searching
if(mat[i] == v1){
checking = false;
l.push_back(mat.size() - i); //we write down the length of the attractor (taking away the position we are at)
for(int k = 0; k < all_attractors.size(); k++){ //let's see if such an attractor has already been recorded
if(mat[i] == all_attractors[k]){
pr = false;
break;
}
}
if(pr){
for(int j = i; j < mat.size(); j++){
all_attractors.push_back(mat[j]);
//if such an attractor has not been encountered, we write it into the attractor matrix
}
attractors.push_back(mat[i]);
//writing down the attractor
}
break;
}
}
mat.push_back(v1); //we write the resulting vector
}
show_state(mat);
}
for(int i = 0; i < l.size(); i++){
L = L + l[i]; //sum for the length
}
L = L / l.size(); //divide by the number of attractors, getting the arithmetic mean (typical length of the attractor L)
cout << "Length attractor L: " << L << endl;
cout << "Number attractors M: " << attractors.size() << endl;
show(all_attractors); //we derive unique attractors
//cout << "\n\n\n";
//show(attractors);
return 0;
}