-void MTPGraph::decrease_distance_in_heap(Vertex *v) {
- Vertex **p, **h;
- // There is some beauty in that
- h = v->heap_slot;
- while(h > _heap &&
- (p = _heap + (h - _heap + 1) / 2 - 1,
- (*p)->distance_from_source > (*h)->distance_from_source)) {
- swap(*p, *h);
- swap((*p)->heap_slot, (*h)->heap_slot);
- h = p;
- }
-}
-
-void MTPGraph::increase_distance_in_heap(Vertex *v) {
- Vertex **c1, **c2, **h;
- // There is some beauty in that
- h = v->heap_slot;
- while(c1 = _heap + 2 * (h - _heap + 1) - 1, c2 = c1 + 1,
- (c1 < _heap + _heap_size && (*c1)->distance_from_source < (*h)->distance_from_source)
- ||
- (c2 < _heap + _heap_size && (*c2)->distance_from_source < (*h)->distance_from_source)
- ) {
- if(c1 < _heap + _heap_size &&
- !(c2 < _heap + _heap_size && (*c2)->distance_from_source < (*c1)->distance_from_source)){
- swap(*c1, *h);
- swap((*c1)->heap_slot, (*h)->heap_slot);
- h = c1;
- } else {
- swap(*c2, *h);
- swap((*c2)->heap_slot, (*h)->heap_slot);
- h = c2;
- }
- }
-}
-
-void MTPGraph::dp_distance_propagation() {