equal
deleted
inserted
replaced
515 |
515 |
516 ///Processes the next node. |
516 ///Processes the next node. |
517 |
517 |
518 ///Processes the next node. |
518 ///Processes the next node. |
519 /// |
519 /// |
|
520 ///\return The processed node. |
|
521 /// |
520 ///\warning The queue must not be empty! |
522 ///\warning The queue must not be empty! |
521 void processNextNode() |
523 Node processNextNode() |
522 { |
524 { |
523 if(_queue_tail==_queue_next_dist) { |
525 if(_queue_tail==_queue_next_dist) { |
524 _curr_dist++; |
526 _curr_dist++; |
525 _queue_next_dist=_queue_head; |
527 _queue_next_dist=_queue_head; |
526 } |
528 } |
533 _reached->set(m,true); |
535 _reached->set(m,true); |
534 _pred->set(m,e); |
536 _pred->set(m,e); |
535 // _pred_node->set(m,n); |
537 // _pred_node->set(m,n); |
536 _dist->set(m,_curr_dist); |
538 _dist->set(m,_curr_dist); |
537 } |
539 } |
|
540 return n; |
538 } |
541 } |
539 |
542 |
540 ///\brief Returns \c false if there are nodes |
543 ///\brief Returns \c false if there are nodes |
541 ///to be processed in the queue |
544 ///to be processed in the queue |
542 /// |
545 /// |