forked from bamsarts/DS-ALGO
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathservergraph.java
83 lines (75 loc) · 3.08 KB
/
servergraph.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
package jcg.ssowmya.demo.graphExample;
import java.util.*;
public class ServerGraph {
private Map<ServerVertex, List> adjServerVertices;
public ServerGraph() {
adjServerVertices = new LinkedHashMap();
}
public Map<ServerVertex, List> getAdjServerVertices() {
return adjServerVertices;
}
public void setAdjServerVertices(Map<ServerVertex, List> adjServerVertices) {
this.adjServerVertices = adjServerVertices;
}
public List getAdjVerticesForServerVertex(ServerVertex serverVertex) {
return adjServerVertices.get(serverVertex);
}
public void addServerVertex(ServerVertex serverVertex) {
adjServerVertices.putIfAbsent(serverVertex,new ArrayList());
}
public void removeServerVertexByIpAddress(String ipAddress) {
if(adjServerVertices.isEmpty())
return;
Optional serverVertexOptional = adjServerVertices.keySet().stream().filter(serverVertex -> ipAddress.equals(serverVertex.getServerConfig().getIpAddress())).findAny();
if(!serverVertexOptional.isPresent())
return;
ServerVertex serverVertexToBeRemoved = serverVertexOptional.get();
adjServerVertices.values().stream().forEach(serverVertexList-> {
serverVertexList.remove(serverVertexToBeRemoved);
});
adjServerVertices.remove(serverVertexToBeRemoved);
}
public void addEdge(ServerEdge edge){
adjServerVertices.get(edge.getStart()).add(edge.getEnd());
adjServerVertices.get(edge.getEnd()).add(edge.getStart());
}
public void removeEdge(ServerEdge edge) {
adjServerVertices.get(edge.getStart()).remove(edge.getEnd());
adjServerVertices.get(edge.getEnd()).remove(edge.getStart());
}
public List depthFirstTraversal(ServerVertex root) {
List visitedNodes = new ArrayList();
Stack serverVertexStack = new Stack();
serverVertexStack.push(root);
while(!serverVertexStack.isEmpty()) {
ServerVertex visitedElement = serverVertexStack.pop();
if(!visitedNodes.contains(visitedElement)) {
visitedNodes.add(visitedElement);
for(ServerVertex sv:getAdjVerticesForServerVertex(visitedElement))
serverVertexStack.push(sv);
}
}
return visitedNodes;
}
public List breadthFirstTraversal(ServerVertex root) {
List visitedNodes = new ArrayList();
Queue serverVertexQueue = new LinkedList();
serverVertexQueue.add(root);
visitedNodes.add(root);
while(!serverVertexQueue.isEmpty()) {
ServerVertex visitedElement = serverVertexQueue.poll();
for(ServerVertex sv:getAdjVerticesForServerVertex(visitedElement))
if(!visitedNodes.contains(sv)) {
visitedNodes.add(sv);
serverVertexQueue.add(sv);
}
}
return visitedNodes;
}
@Override
public String toString() {
return "ServerGraph{" +
"adjServerVertices=" + adjServerVertices +
'}';
}
}