/
NonLinearCode.cpp
140 lines (120 loc) · 2.57 KB
/
NonLinearCode.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
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <Windows.h>
#include <time.h>
#include <vector>
#include <numeric>
using namespace std;
int function;
int maxlevel;
int vn;
int vc[20];
inline int HammingDist(int a, int b, int n)
{
int c = a^b;
int ans = 0;
for(int i=0; i<n; i++)
if(c&(1<<i))
ans++;
return ans;
}
void GenerateCand(int n, int d, vector<int> &cand)
{
for(int i=0; i<(1<<n); i++) {
if (HammingDist(0, i, n)>=d)
cand.push_back(i);
}
//printf("candsize=%d\n",cand.size());
}
void backtrack(int n, int d, int node, vector<int> cand, int level)
{
vector<int> candNext;
vn++;
for (int i=0; i<cand.size(); i++)
{
if(HammingDist(node, cand[i], n)>=d) {
candNext.push_back(cand[i]);
}
}
if(candNext.size()==0) {
if(level>maxlevel) {
maxlevel = level;
//printf("update maxlevel=%d\n",maxlevel);
}
return;
}
for (int i=0; i<candNext.size(); i++) {
backtrack(n, d, candNext[i], candNext, level+1);
}
}
void knuth(int n, int d, int node, vector<int> cand, int level)
{
vector<int> candNext;
for (int i=0; i<cand.size(); i++)
{
if(HammingDist(node, cand[i], n)>=d) {
candNext.push_back(cand[i]);
}
}
if(candNext.size()==0) {
if(level>maxlevel) {
maxlevel = level;
//printf("update maxlevel=%d\n",maxlevel);
}
return;
}
vc[level]=candNext.size();
backtrack(n, d, candNext[1], candNext, level+1);
}
void init(int n, int d)
{
vector<int> cand;
GenerateCand(n, d, cand);
maxlevel = 0;
vn=0;
memset(vc, 0, sizeof(int)*20);
if(function==0)
backtrack(n, d, 0, cand, 0);
else if(function==1){
knuth(n, d, 0, cand, 0);
int sum = 0;
int est = 1;
for(int i=0; i<maxlevel; i++)
{
est *= vc[i];
sum += est;
}
printf("Estimate node visit=%d\n",sum);
}
}
int main()
{
SYSTEMTIME systime;
GetSystemTime(&systime);
srand(systime.wMilliseconds);
_int64 start, end;
LARGE_INTEGER litmp;
double dfFreq;
QueryPerformanceFrequency(&litmp);
dfFreq = (double)litmp.QuadPart;
QueryPerformanceCounter(&litmp);
_int64 estimatenode;
_int64 estimateans;
for (function=0; function<=1; function++) {
for (int i=4; i<8; i++){
if(function==0) {
start = litmp.QuadPart;
init(i, 4);
QueryPerformanceCounter(&litmp);
end = litmp.QuadPart;
printf("A(%d,4)=%d Visited node=%-9dRunning time(ms)=%lf\n", i, maxlevel+1,vn,(double)(end-start)*1000/dfFreq);
}
else if(function==1) {
init(i, 4);
}
}
}
system("pause");
return 0;
}