Newer
Older
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
package INF102.lab5.graph;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
public class AdjacencySet<V> implements IGraph<V> {
private Set<V> nodes;
private Map<V, Set<V>> nodeToNode;
public AdjacencySet() {
nodes = new HashSet<>();
nodeToNode = new HashMap<>();
}
@Override
public int size() {
return nodes.size();
}
@Override
public Set<V> getNodes() {
return Collections.unmodifiableSet(nodes);
}
@Override
public void addNode(V node) {
throw new UnsupportedOperationException("Implement me :)");
}
@Override
public void removeNode(V node) {
throw new UnsupportedOperationException("Implement me :)");
}
@Override
public void addEdge(V u, V v) {
throw new UnsupportedOperationException("Implement me :)");
}
@Override
public void removeEdge(V u, V v) {
throw new UnsupportedOperationException("Implement me :)");
}
@Override
public boolean hasNode(V node) {
throw new UnsupportedOperationException("Implement me :)");
}
@Override
public boolean hasEdge(V u, V v) {
return nodeToNode.get(u).contains(v);
}
@Override
public Set<V> getNeighbourhood(V node) {
return Collections.unmodifiableSet(nodeToNode.get(node));
}
@Override
public String toString() {
StringBuilder build = new StringBuilder();
for (V node : nodeToNode.keySet()) {
Set<V> nodeList = nodeToNode.get(node);
build.append(node);
build.append(" --> ");
build.append(nodeList);
build.append("\n");
}
return build.toString();
}
}