forked from techpanja/interviewproblems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAbstractGraph.java
More file actions
176 lines (153 loc) · 5.23 KB
/
AbstractGraph.java
File metadata and controls
176 lines (153 loc) · 5.23 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
package graphs.graph;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import static graphs.breadthfirstsearch.BFS.bfs;
/**
* Abstract class depicting a graph.
* User: rpanjrath
* Date: 10/24/13
* Time: 5:39 PM
*/
public abstract class AbstractGraph implements Graph {
protected AbstractGraph() {
}
@Override
public abstract int getCurrentSize();
@Override
public abstract Vertex[] getVertexesAsArray();
@Override
public abstract int getMaxSize();
public abstract void setCurrentSize(int currentSize);
@Override
public List<Vertex> getVertexesAsList() {
List<Vertex> vertexList = new ArrayList<>();
vertexList.addAll(Arrays.asList(getVertexesAsArray()));
vertexList.removeAll(Collections.singleton(null));
return vertexList;
}
@Override
public Vertex getFirstVertex() {
if (getVertexesAsArray().length > 0)
return getVertexesAsArray()[0];
else
return null;
}
@Override
public boolean addVertex(Vertex vertex) {
if (getCurrentSize() == getMaxSize()) {
System.out.println("Reached max size!");
return false;
}
List<Vertex> vertexList = Arrays.asList(getVertexesAsArray());
if (!canAddVertex(vertex, vertexList)) {
return false;
}
getVertexesAsArray()[getCurrentSize()] = vertex;
setCurrentSize(getCurrentSize() + 1);
return true;
}
protected boolean canAddVertex(Vertex vertex, List<Vertex> vList) {
List<Vertex> vertexList = new ArrayList<>();
vertexList.addAll(vList);
vertexList.removeAll(Collections.singleton(null));
for (Vertex tempVertex : vertexList) {
if (tempVertex != null && vertex != null
&& vertex.toString().equalsIgnoreCase(tempVertex.toString())) {
System.out.println("Vertex already exists " + vertex);
System.out.println();
return false;
}
}
return true;
}
public void displayGraphDependency() {
System.out.println();
for (Vertex tempVertex : getVertexesAsList()) {
if (tempVertex.getDependsOn().size() > 0) {
System.out.print("Vertex \"" + tempVertex + "\" depends on :-> ");
for (Vertex vertex : tempVertex.getDependsOn()) {
System.out.print(vertex + ", ");
}
System.out.println();
} else {
System.out.println("Vertex \"" + tempVertex + "\": No dependencies.");
}
}
}
public void displayVertexList() {
System.out.println("Vertex List:----");
for (Vertex vertex : getVertexesAsList()) {
System.out.println("Vertex: " + vertex);
}
}
@Override
public boolean isVertexExisting(Vertex vertex) {
for (Vertex tempVertex : getVertexesAsList()) {
if (tempVertex.toString().equalsIgnoreCase(vertex.toString())) {
return true;
}
}
// System.out.println("Edge cannot be added for non-existing vertex: " + vertex);
// System.out.println();
return false;
}
@Override
public Vertex getVertex(String vertexLabel) {
for (Vertex tempVertex : getVertexesAsList()) {
if (tempVertex.toString().equalsIgnoreCase(vertexLabel)) {
return tempVertex;
}
}
return null;
}
@Override
public abstract boolean addEdge(Vertex fromVertex, Vertex toVertex);
@Override
public List<Vertex> topoSortGraph() {
List<Vertex> vertexList = getVertexesAsList();
return topoSortHelper(vertexList);
}
@Override
public List<Vertex> topoSortGraph(Vertex vertex) {
List<Vertex> vertexList = bfs(vertex);
return topoSortHelper(vertexList);
}
private List<Vertex> topoSortHelper(List<Vertex> vertexList) {
int counter = vertexList.size();
Vertex currentVertex;
List<Vertex> sortedVertexList = new ArrayList<>();
while (counter > 0) {
counter--;
for (Vertex vertex : vertexList) {
if (!sortedVertexList.contains(vertex)
&& (vertex.getDependsOn().size() == 0 || allDependenciesVisited(vertex))) {
currentVertex = vertex;
sortedVertexList.add(currentVertex);
currentVertex.setVisited(true);
break;
}
}
if (sortedVertexList.isEmpty()) {
System.out.println("Cyclic Dependencies cannot be resolved.");
return sortedVertexList;
}
}
resetVisitedState(vertexList);
return sortedVertexList;
}
private boolean allDependenciesVisited(Vertex vertex) {
for (Vertex temp : vertex.getDependsOn()) {
if (!temp.isVisited()) {
return false;
}
}
return true;
}
private void resetVisitedState(List<Vertex> vertexList) {
for (Vertex vertex : vertexList) {
vertex.setVisited(false);
}
}
}