Repository navigation
Expand file tree
/
Copy pathVertex.java
More file actions
106 lines (89 loc) · 2.01 KB
/
Copy pathVertex.java
File metadata and controls
106 lines (89 loc) · 2.01 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
package DepthFirstSearch;
import java.util.ArrayList;
import java.util.List;
public class Vertex {
// private int data;
// private boolean visited;
// private List<Vertex> neighbourList;
//
// public Vertex(int data){
// this.data=data;
// this.neighbourList = new ArrayList<>();
// }
//
// public void addNeighbour(Vertex vertex){
// this.neighbourList.add(vertex);
// }
//
// public int getData() {
// return data;
// }
//
// public void setData(int data) {
// this.data = data;
// }
//
// public boolean isVisited() {
// return visited;
// }
//
// public void setVisited(boolean visited) {
// this.visited = visited;
// }
//
// public List<Vertex> getNeighbourList() {
// return neighbourList;
// }
//
// @Override
// public String toString() {
// return ""+this.data;
// }
private String name;
private List<Vertex> neighbourList;
private boolean visited;
private Vertex predecessor;
private int startingRank;
private int finishingRank;
public Vertex(String name) {
this.name = name;
this.neighbourList = new ArrayList<>();
}
public void addNeighbour(Vertex vertex) {
this.neighbourList.add(vertex);
}
public Vertex getPredecessor() {
return predecessor;
}
public void setPredecessor(Vertex predecessor) {
this.predecessor = predecessor;
}
public int getStartingRank() {
return startingRank;
}
public void setStartingRank(int startingRank) {
this.startingRank = startingRank;
}
public String getName() {
return name;
}
public int getFinishingRank() {
return finishingRank;
}
public void setFinishingRank(int finishingRank) {
this.finishingRank = finishingRank;
}
public boolean isVisited() {
return visited;
}
public void setVisited(boolean visited) {
this.visited = visited;
}
public List<Vertex> getNeighbourList() {
return neighbourList;
}
@Override
public String toString() {
return this.name+"- StartTime: "+startingRank+"- EndTime: "+finishingRank;
}
}