-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraph.java
More file actions
executable file
·237 lines (170 loc) · 6.1 KB
/
Graph.java
File metadata and controls
executable file
·237 lines (170 loc) · 6.1 KB
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
227
228
229
230
231
232
233
234
235
236
import java.lang.*;
import java.util.Vector;
import java.util.Collections;
public class Graph {
public static int numChange = 0 ;
private Vector graph;
private Vector distributions;
public Vector result;
private int numNodes;
public Graph(int numNodes) {
this.numNodes = numNodes;
graph = new Vector<Vector>();
for(int i = 0 ; i <= numNodes ; i++)
graph.add(new Vector<Integer>());
for (int i = 1; i <= numNodes ; i++)
addedge(i,i);
distributions = new Vector<Vector>();
for (int i = 0; i <= numNodes ; i++)
distributions.add(new Vector<Label>());
result = new Vector<Integer>();
}
public void intializeDist() {
for (int i = 1; i <= numNodes ; i++) {
Collections.sort(((Vector) (graph.get(i))));
Vector v = (Vector) (graph.get(i));
Vector vd = (Vector)(distributions.get(i));
for (int j = 0; j < v.size() ; j++)
vd.add(new Label((int) v.get(j), 1.0 / v.size()));
}
// for (int i = 1; i <= numNodes ; i++) {
// Vector v = (Vector) (graph.get(i));
// Vector vd = (Vector)(distributions.get(i));
// for (int j = 0; j < v.size() ; j++) {
// Vector v1 = (Vector) (graph.get((int) v.get(j)));
// for (int k = 0; k < v1.size() ; k++)
// setElement(vd , (int)v1.get(k));
//
// }
// }
}
public void addedge(int source, int destination) {
((Vector) (graph.get(source))).add(destination);
}
public void propagation() {
for (int i = 1; i <= numNodes ; i++) {
Vector temp = (Vector) distributions.get(i);
Vector adjacent = (Vector) graph.get(i);
for (int j = 0; j < temp.size() ; j++) {
double newP = 0;
Label la = (Label)temp.get(j);
int label = la.label;
for (int k = 0; k < adjacent.size() ; k++) {
int a = (int)adjacent.get(k);
Vector t = (Vector) distributions.get(a);
for (int l = 0; l < t.size() ; l++)
if(((Label)t.get(l) ).label == label) {
newP += ((Label) t.get(l)).p0;
}
}
la.p0 = la.p;
la.p = newP;
}
}
}
public void inflation(double in) {
for (int i = 1; i <= numNodes ; i++) {
Vector temp = (Vector) distributions.get(i);
double sum = 0;
for (int j = 0; j < temp.size() ; j++)
sum += Math.pow(((Label)temp.get(j)).p , in);
for(int j = 0; j < temp.size() ; j++)
((Label)temp.get(j)).p = Math.pow(((Label)temp.get(j)).p, in)/sum;
}
}
public void cutoff(double r) {
for (int i = 1; i <= numNodes ; i++) {
Vector temp = (Vector) distributions.get(i);
for (int j = 0; j < temp.size() ; j++)
if(((Label)temp.get(j)).p < r)
temp.remove(j);
}
}
public void update(double q) {
for (int i = 1; i <= numNodes ; i++) {
int sum = 0;
Vector me = (Vector) graph.get(i);
Vector medist = (Vector) distributions.get(i);
for(int j = 0 ; j < me.size() ; j++ )
sum += isSubset(medist , (Vector) distributions.get((Integer) me.get(j)));
if(sum < q * me.size()) {
numChange++;
for (int j = 0; j < medist.size(); j++)
((Label) medist.get(j)).p0 = ((Label) medist.get(j)).p;
}
else
for (int j = 0; j < medist.size() ; j++)
((Label)medist.get(j)).p = ((Label)medist.get(j)).p0;
}
}
public boolean stop() {
return numChange == 0;
}
public void setResult() {
result.add(0);
for (int i = 1; i <= numNodes ; i++)
result.add(((Label)((Vector)distributions.get(i)).get(0)).label);
}
public int isSubset(Vector ci , Vector cj) {
for (int i = 0; i < ci.size() ; i++) {
if(!findelement(cj , ((Label)ci.get(i)).label , 0 , cj.size() - 1)) ;
return 0;
}
return 1;
}
@Override
public String toString() {
String result = "";
// for (int i = 1; i <= numNodes ; i++) {
// Vector v = (Vector) graph.get(i);
// result += i + " => ";
// for (int j = 0; j < v.size() ; j++) {
// int a = (int) v.get(j);
// result += a+ " ";
// }
// result += "\n";
// }
for (int i = 1; i <= numNodes ; i++) {
Vector v = (Vector) distributions.get(i);
for (int j = 0; j < v.size() ; j++) {
Label l = (Label) v.get(j);
result += l.label + "=>" + l.p + " ";
java.lang.System.out.print(" "+v.size()+" ");
}
result += "\n";
java.lang.System.out.print(" "+ i+ " ");
}
return result;
}
public boolean findelement(Vector v, int x, int i , int j) {
if(j - i >= 0 ) {
int q = (i + j) / 2;
if (((Label) v.get(q)).label == x)
return true;
if (((Label) v.get(q)).label > x)
return findelement(v, x, q + 1, j);
if (((Label) v.get(q)).label < x)
return findelement(v, x, i, q - 1);
}
return false;
}
public void setElement(Vector v, int x) {
int k = 0;
v.add(new Label(Integer.MAX_VALUE , 0 ));
while(((Label) v.get(k)).label < x)
k++;
if(((Label) v.get(k)).label != x)
v.insertElementAt(new Label(x , 0) , k);
v.remove(v.size() - 1);
}
public class Label {
int label;
double p;
double p0;
public Label(int label, double p) {
this.label = label;
this.p = p;
p0 = p;
}
}
}