Changeset 1665:fdeb961110ac in lemon0.x
 Timestamp:
 08/30/05 16:55:11 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2181
 Location:
 lemon
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

lemon/bfs.h
r1631 r1665 544 544 } 545 545 546 ///Next node to be processed. 547 548 ///Next node to be processed. 549 /// 550 ///\return The next node to be processed or INVALID if the queue is 551 /// empty. 552 Node NextNode() 553 { 554 return _queue_tail<_queue_head?_queue[_queue_tail]:INVALID; 555 } 556 546 557 ///\brief Returns \c false if there are nodes 547 558 ///to be processed in the queue 
lemon/dfs.h
r1664 r1665 553 553 return e; 554 554 } 555 ///Next edge to be processed. 556 557 ///Next edge to be processed. 558 /// 559 ///\return The next edge to be processed or INVALID if the stack is 560 /// empty. 561 OutEdgeIt NextEdge() 562 { 563 return _stack_head>=0?_stack[_stack_head]:INVALID; 564 } 555 565 556 566 ///\brief Returns \c false if there are nodes … … 559 569 ///Returns \c false if there are nodes 560 570 ///to be processed in the queue 571 /// 572 ///\todo This should be called emptyStack() or some "neutral" name. 561 573 bool emptyQueue() { return _stack_head<0; } 562 574 ///Returns the number of the nodes to be processed. … … 564 576 ///Returns the number of the nodes to be processed in the queue. 565 577 /// 578 ///\todo This should be called stackSize() or some "neutral" name. 566 579 int queueSize() { return _stack_head+1; } 567 580 
lemon/dijkstra.h
r1631 r1665 547 547 } 548 548 549 ///Next node to be processed. 550 551 ///Next node to be processed. 552 /// 553 ///\return The next node to be processed or INVALID if the priority heap 554 /// is empty. 555 Node NextNode() 556 { 557 return _heap.empty()?_heap.top():INVALID; 558 } 559 549 560 ///\brief Returns \c false if there are nodes 550 561 ///to be processed in the priority heap
Note: See TracChangeset
for help on using the changeset viewer.