equal
deleted
inserted
replaced
510 { |
510 { |
511 _reached->set(s,true); |
511 _reached->set(s,true); |
512 _pred->set(s,INVALID); |
512 _pred->set(s,INVALID); |
513 // _predNode->set(u,INVALID); |
513 // _predNode->set(u,INVALID); |
514 OutEdgeIt e(*G,s); |
514 OutEdgeIt e(*G,s); |
515 if(e!=INVALID) _stack[++_stack_head]=e; |
515 if(e!=INVALID) { |
516 else _processed->set(s,true); |
516 _stack[++_stack_head]=e; |
517 _dist->set(s,_stack_head); |
517 _dist->set(s,_stack_head); |
|
518 } |
|
519 else { |
|
520 _processed->set(s,true); |
|
521 _dist->set(s,0); |
|
522 } |
518 } |
523 } |
519 } |
524 } |
520 |
525 |
521 ///Processes the next edge. |
526 ///Processes the next edge. |
522 |
527 |