(FibNode<T> x, double k)
| 221 | } |
| 222 | |
| 223 | public void decreaseKey(FibNode<T> x, double k) |
| 224 | { |
| 225 | if(k > x.key) |
| 226 | throw new RuntimeException("new key is greater than current key"); |
| 227 | x.key = k; |
| 228 | FibNode<T> y = x.p; |
| 229 | if(y != null && x.key < y.key) |
| 230 | { |
| 231 | cut(x, y); |
| 232 | cascadingCut(y); |
| 233 | } |
| 234 | if(x.key < min.key) |
| 235 | min = x; |
| 236 | } |
| 237 | |
| 238 | /** |
| 239 | * |