lemon/dijkstra.h
changeset 713 4ac30454f1c1
parent 584 33c6b6e755cd
child 717 684964884a2e
equal deleted inserted replaced
26:1c84deb82bea 27:c0385be953d3
   582   public:
   582   public:
   583 
   583 
   584     ///\name Execution Control
   584     ///\name Execution Control
   585     ///The simplest way to execute the %Dijkstra algorithm is to use
   585     ///The simplest way to execute the %Dijkstra algorithm is to use
   586     ///one of the member functions called \ref run(Node) "run()".\n
   586     ///one of the member functions called \ref run(Node) "run()".\n
   587     ///If you need more control on the execution, first you have to call
   587     ///If you need better control on the execution, you have to call
   588     ///\ref init(), then you can add several source nodes with
   588     ///\ref init() first, then you can add several source nodes with
   589     ///\ref addSource(). Finally the actual path computation can be
   589     ///\ref addSource(). Finally the actual path computation can be
   590     ///performed with one of the \ref start() functions.
   590     ///performed with one of the \ref start() functions.
   591 
   591 
   592     ///@{
   592     ///@{
   593 
   593