src/main/java/de/dfki/lt/loot/jada/FibonacciHeapBase.java
private void insert(HeapNode<Data> other) {
      if (other == null)
        return;

      // For example: given 1->2->3->4->1, insert a->b->c->d->a after node 3:
      //	result: 1->2->3->a->b->c->d->4->1

      this.next.previous = other.previous;
      other.previous.next = this.next;

      this.next = other;
      other.previous = this;
    }
// inserts a new node after this node
inserts a new node after this node
inserts a new node after this node
private void insert(HeapNode<Data> other) {
      if (other == null)
        return;
      this.next.previous = other.previous;
      other.previous.next = this.next;
      this.next = other;
      other.previous = this;
    }
private void insert ( HeapNode < Data > other ) { if ( other == null ) return ; this . next . previous = other . previous ; other . previous . next = this . next ; this . next = other ; other . previous = this ; }
inserts a new node after this node
inserts a new node after this node
// For example: given 1->2->3->4->1, insert a->b->c->d->a after node 3: //	result: 1->2->3->a->b->c->d->4->1