Repository navigation
Expand file tree
/
Copy pathVertex.java
More file actions
75 lines (58 loc) · 1.52 KB
/
Copy pathVertex.java
File metadata and controls
75 lines (58 loc) · 1.52 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
package Dijkstra;
import java.util.ArrayList;
import java.util.List;
/**
* Created by songchiyun on 2017. 3. 15..
*/
public class Vertex implements Comparable<Vertex>{
private String name;
private List<Edge> adjacenciesList;
private boolean visited;
private Vertex prodecessor;
private double distance = Double.MAX_VALUE;
Vertex(String name){
this.name = name;
adjacenciesList = new ArrayList<>();
}
public void addNeighbor(Edge edge){
adjacenciesList.add(edge);
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public List<Edge> getAdjacenciesList() {
return adjacenciesList;
}
public void setAdjacenciesList(List<Edge> adjacenciesList) {
this.adjacenciesList = adjacenciesList;
}
public boolean isVisited() {
return visited;
}
public void setVisited(boolean visited) {
this.visited = visited;
}
public Vertex getProdecessor() {
return prodecessor;
}
public void setProdecessor(Vertex prodecessor) {
this.prodecessor = prodecessor;
}
public double getDistance() {
return distance;
}
public void setDistance(double distance) {
this.distance = distance;
}
@Override
public String toString(){
return this.name;
}
@Override
public int compareTo(Vertex otherVertex) {
return Double.compare(this.distance, otherVertex.getDistance());
}
}