/
Person.java
102 lines (79 loc) · 1.93 KB
/
Person.java
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
package simsalabim;
import java.util.*;
/**
* Class for a node in social network.
*/
class Person implements Comparable<Person> {
public LinkedList<Person> outN = new LinkedList<Person>();
public int id;
private boolean does_darknet = false;
private boolean does_opennet = false;
public int netid = 0; // Network partition
public int score = 0;
private DarknetNode node;
public Person(int id) {
this.id = id;
}
public Iterator<Person> neighbors() {
return outN.iterator();
}
public boolean isOpennet() {
if (!does_darknet && !does_opennet) throw new SimulationException ("Node " + this + " without type.");
return does_opennet;
}
public boolean isDarknet() {
if (!does_darknet && !does_opennet) throw new SimulationException ("Node " + this + " without type.");
return does_darknet;
}
public int degree() {
return outN.size();
}
public int network() {
return netid;
}
public void setNetwork(int id) {
netid = id;
}
public void setDarknet() {
does_darknet = true;
}
public void setOpennet() {
does_opennet = true;
}
public void joinedNetwork(DarknetNode node) {
this.node = node;
}
public void leftNetwork() {
this.node = null;
}
public boolean isInNetwork() {
return node != null;
}
public DarknetNode getNode() {
return node;
}
public void addOut(Person n) {
if (!outN.contains(n))
outN.add(n);
}
public boolean linksTo(Person n) {
return outN.contains(n);
}
public void removeNeighbor(Person n) {
outN.remove(n);
}
public int compareTo(Person o) {
return ( score > o.score ?
1 :
( score < o.score ?
-1 :
( id > o.id ?
1:
( id < o.id ?
-1:
0))));
}
public boolean equals(Object o) {
return ((Person) o).id == id && ((Person) o).score == score;
}
}