Changeset 1151:b217fc69f913 in lemon-0.x for src/lemon/dijkstra.h
- Timestamp:
- 02/16/05 17:17:30 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1552
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/dijkstra.h
r1132 r1151 31 31 32 32 33 /// \addtogroup flowalgs 34 /// @{ 35 33 36 34 ///Default traits class of Dijkstra class. 37 35 … … 130 128 ///%Dijkstra algorithm class. 131 129 130 /// \ingroup flowalgs 132 131 ///This class provides an efficient implementation of %Dijkstra algorithm. 133 132 ///The edge lengths are passed to the algorithm using a … … 497 496 } 498 497 499 void processN ode()498 void processNextNode() 500 499 { 501 500 Node v=_heap.top(); … … 541 540 void start() 542 541 { 543 while ( !_heap.empty() ) processN ode();542 while ( !_heap.empty() ) processNextNode(); 544 543 } 545 544 … … 560 559 void start(Node dest) 561 560 { 562 while ( !_heap.empty() && _heap.top()!=dest ) processN ode();561 while ( !_heap.empty() && _heap.top()!=dest ) processNextNode(); 563 562 if ( _heap.top()==dest ) finalizeNodeData(_heap.top()); 564 563 } … … 576 575 void start(const NM &nm) 577 576 { 578 while ( !_heap.empty() && !mn[_heap.top()] ) processN ode();577 while ( !_heap.empty() && !mn[_heap.top()] ) processNextNode(); 579 578 if ( !_heap.empty() ) finalizeNodeData(_heap.top()); 580 579 } … … 696 695 /// Default traits used by \ref DijkstraWizard 697 696 698 /// To make it easier to use Dijkstra algorithm we have created a wizard class. 699 /// This \ref DijkstraWizard class needs default traits, as well as the \ref Dijkstra class. 697 /// To make it easier to use Dijkstra algorithm 698 ///we have created a wizard class. 699 /// This \ref DijkstraWizard class needs default traits, 700 ///as well as the \ref Dijkstra class. 700 701 /// The \ref DijkstraWizardBase is a class to be the default traits of the 701 702 /// \ref DijkstraWizard class. … … 745 746 /// A class to make easier the usage of Dijkstra algorithm 746 747 748 /// \ingroup flowalgs 747 749 /// This class is created to make it easier to use Dijkstra algorithm. 748 750 /// It uses the functions and features of the plain \ref Dijkstra, 749 /// but it is much more simpleto use it.751 /// but it is much simpler to use it. 750 752 /// 751 753 /// Simplicity means that the way to change the types defined 752 754 /// in the traits class is based on functions that returns the new class 753 /// and not on templatable built-in classes. When using the plain \ref Dijkstra 754 /// the new class with the modified type comes from the original class by using the :: 755 /// operator. In the case of \ref DijkstraWizard only a function have to be called and it will 755 /// and not on templatable built-in classes. 756 /// When using the plain \ref Dijkstra 757 /// the new class with the modified type comes from 758 /// the original class by using the :: 759 /// operator. In the case of \ref DijkstraWizard only 760 /// a function have to be called and it will 756 761 /// return the needed class. 757 762 /// … … 899 904 ///\e 900 905 906 /// \ingroup flowalgs 901 907 ///\todo Please document... 902 908 ///
Note: See TracChangeset
for help on using the changeset viewer.