-
Notifications
You must be signed in to change notification settings - Fork 0
/
dijkstraCapacidades.java
168 lines (136 loc) · 3.26 KB
/
dijkstraCapacidades.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
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
import java.lang.*;
import java.util.*;
class Qnode {
int vert;
int vertkey;
Qnode(int v, int key) {
vert = v;
vertkey = key;
}
}
class Heapmax {
private static int posinvalida = 0;
int sizeMax,size;
Qnode[] a;
int[] pos_a;
Heapmax(int vec[], int n) {
a = new Qnode[n + 1];
pos_a = new int[n + 1];
sizeMax = n;
size = n;
for (int i = 1; i <= n; i++) {
a[i] = new Qnode(i,vec[i]);
pos_a[i] = i;
}
for (int i = n/2; i >= 1; i--)
heapify(i);
}
boolean isEmpty() {
if (size == 0) return true;
return false;
}
int extractMax() {
int vertv = a[1].vert;
swap(1,size);
pos_a[vertv] = posinvalida; // assinala vertv como removido
size--;
heapify(1);
return vertv;
}
void increaseKey(int vertv, int newkey) {
int i = pos_a[vertv];
a[i].vertkey = newkey;
while (i > 1 && compare(i, parent(i)) > 0) {
swap(i, parent(i));
i = parent(i);
}
}
void insert(int vertv, int key)
{
if (sizeMax == size)
new Error("Heap is full\n");
size++;
a[size].vert = vertv;
pos_a[vertv] = size; // supondo 1 <= vertv <= n
increaseKey(vertv,key); // aumenta a chave e corrige posicao se necessario
}
void write_heap(){
System.out.printf("Max size: %d\n",sizeMax);
System.out.printf("Current size: %d\n",size);
System.out.printf("(Vert,Key)\n---------\n");
for(int i=1; i <= size; i++)
System.out.printf("(%d,%d)\n",a[i].vert,a[i].vertkey);
System.out.printf("-------\n(Vert,PosVert)\n---------\n");
for(int i=1; i <= sizeMax; i++)
if (pos_valida(pos_a[i]))
System.out.printf("(%d,%d)\n",i,pos_a[i]);
}
private int parent(int i){
return i/2;
}
private int left(int i){
return 2*i;
}
private int right(int i){
return 2*i+1;
}
private int compare(int i, int j) {
if (a[i].vertkey < a[j].vertkey)
return -1;
if (a[i].vertkey == a[j].vertkey)
return 0;
return 1;
}
private void heapify(int i) {
int l, r, largest;
l = left(i);
if (l > size) l = i;
r = right(i);
if (r > size) r = i;
largest = i;
if (compare(l,largest) > 0)
largest = l;
if (compare(r,largest) > 0)
largest = r;
if (i != largest) {
swap(i, largest);
heapify(largest);
}
}
private void swap(int i, int j) {
Qnode aux;
pos_a[a[i].vert] = j;
pos_a[a[j].vert] = i;
aux = a[i];
a[i] = a[j];
a[j] = aux;
}
private boolean pos_valida(int i) {
return (i >= 1 && i <= size);
}
}
class dijkstraCapacidades {
public static int min(int a, int b) {
if (a<b) return a;
return b;
}
public static void dijkstraCap(Grfao g, int s) {
int cap[] = new int[g.num_vertices()+1];
int pai[] = new int[g.num_vertices()+1];
cap[s] = 10000;
Heapmax q = new Heapmax(cap, g.num_vertices());
while (!q.isEmpty()) {
int v = q.extractMax();
LinkedList<Arco> adjs = g.adjs_no(v);
for (Arco a : adjs) {
int w = a.extremo_final();
int c = g.find_arc(v, w).valor_arco();
if (min(cap[v], c) > cap[w]) {
cap[w] = min(cap[v], c);
pai[w] = v;
q.increaseKey(w, cap[w]);
}
}
}
}
}