(FibNode<T> y, FibNode<T> x)
| 153 | } |
| 154 | |
| 155 | private void link(FibNode<T> y, FibNode<T> x) |
| 156 | { |
| 157 | //1| remove y from the root list of H |
| 158 | delink(y); |
| 159 | //2| make y a child of x, incrementing x.degree |
| 160 | x.addChild(y); |
| 161 | x.degree++;//adding y as a child |
| 162 | x.degree += y.degree;//and all of y's children |
| 163 | //3| y.mark = FALSE |
| 164 | y.mark = false; |
| 165 | } |
| 166 | |
| 167 | public double getMinKey() |
| 168 | { |
no test coverage detected