-
Notifications
You must be signed in to change notification settings - Fork 1
/
Vertex.java
66 lines (62 loc) · 1.57 KB
/
Vertex.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
/*
* STUDENT ID:801027386
* STUDENT NAME: ARUN KUNNUMPURAM THOMAS
* FILE NAME: Vertex.java
*
*/
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
public class Vertex {
/*
* contains the details of vertex name, vertex status, list of outgoing edges, distance and predecessor
* comparator for sorting based on vertex name
*/
String vertexName;
boolean status=true;
ArrayList<Edge> outwardEdges= new ArrayList<Edge>();
double distance;
public double getDistance() {
return distance;
}
public void setDistance(double distance) {
this.distance = distance;
}
public Vertex getPredecessor() {
return predecessor;
}
public void setPredecessor(Vertex predecessor) {
this.predecessor = predecessor;
}
Vertex predecessor;
Vertex(String name)
{
vertexName=name;
}
public String getVertexName() {
return vertexName;
}
public void setVertexName(String vertexName) {
this.vertexName = vertexName;
}
public boolean isStatus() {
return status;
}
public void setStatus(boolean status) {
this.status = status;
}
public ArrayList<Edge> getOutwardEdges() {
Collections.sort(outwardEdges,Edge.edgeNameCompartor);
return outwardEdges;
}
public void setOutwardEdges(ArrayList<Edge> outwardEdges) {
this.outwardEdges = outwardEdges;
}
public static Comparator<Vertex> vertexNameCompartor = new Comparator<Vertex>() {
public int compare(Vertex vertex1, Vertex vertex2) {
String vertexName1 = vertex1.getVertexName();
String vertexName2 = vertex2.getVertexName();
return vertexName1.compareTo(vertexName2);
}
};
}