distance->set(v, oldvalue);

 	distance->set(v, oldvalue);

 	for(OutEdgeIt e(*G,v); e!=INVALID; ++e) {

 	for(OutEdgeIt e(*G,v); e!=INVALID; ++e) {

 	  Node w=G->head(e); 

 	  Node w=G->head(e); 

 	  switch(heap.state(w)) {

 	  switch(heap.state(w)) {

 	  case HeapType::PRE_HEAP:

 	  case HeapType::PRE_HEAP:

 	    heap.push(w,oldvalue+(*length)[e]); 

 	    heap.push(w,oldvalue+(*length)[e]); 

 	    predecessor->set(w,e);

 	    predecessor->set(w,e);

 	    pred_node->set(w,v);

 	    pred_node->set(w,v);