-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPriorityQueue1.java
117 lines (94 loc) · 2.12 KB
/
PriorityQueue1.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
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
import java.util.ArrayList;
public class PriorityQueue1 {
private ArrayList<Node<Vertex>> queue = new ArrayList<Node<Vertex>>();
public void add(Vertex info, int p) {
Node<Vertex> n = new Node<Vertex>(info, p);
int start = 0;
int end = queue.size()-1;
int mid = 0;
if(queue.isEmpty()) {
queue.add(n);
return;
}
if(queue.get(0).GetP()<n.GetP()) {
queue.add(0, n);
return;
}
if(queue.get(queue.size()-1).GetP()>n.GetP()) {
queue.add(n);
return;
}
while(start<=end) {
mid = (start+end)/2;
if(queue.get(mid).GetP() > n.GetP()) {
start = mid+1;
}
else if(queue.get(mid).GetP() < n.GetP()) {
end = mid-1;
}
else {
queue.add(mid, n);
return;
}
}
queue.add(start, n);
}
public String toString() {
String output = "";
for(Node<Vertex> r: queue) {
output += r.GetInfo().place;
output += "\n";
}
return output;
}
public Vertex pop(){
return queue.remove(queue.size()-1).GetInfo();
}
public int size() {
return queue.size();
}
public boolean contains(Vertex ins) {
for(Node<Vertex> v: queue) {
if(v.GetInfo().equals(ins))
return true;
}
return false;
}
public void update(Vertex info, int p) {
for(Node<Vertex> k : queue) {
if(k.GetInfo().equals(info)) {
queue.remove(k);
add(info, p);
return;
}
}
System.out.println("no existing Node");
}
public boolean isEmpty() {
return queue.isEmpty();
}
public int getP(Vertex v) {
for(int i = 0; i<queue.size(); i++) {
if(queue.get(i).GetInfo().equals(v)) {
return queue.get(i).GetP();
}
}
return 00000;
}
public static void main(String[] args) {
PriorityQueue1 test = new PriorityQueue1();
Vertex v1 = new Vertex("v1", 10, 10);
Vertex v2 = new Vertex("v2", 20, 20);
Vertex v4 = new Vertex("v4", 50, 30);
Vertex v5 = new Vertex("v5", 14, 50);
test.add(v1, 1);
test.add(v2, 2);
test.add(v4, 4);
test.add(v5, 5);
System.out.println(test.toString());
test.update(v4, 1);
System.out.println(test.toString());
Vertex v = new Vertex("v6", 60, 70);
System.out.println(test.contains(v));
}
}