lemon/dijkstra.h
changeset 717 684964884a2e
parent 716 f47b6c94577e
parent 713 4ac30454f1c1
child 786 e20173729589
child 787 c2230649a493
equal deleted inserted replaced
28:fd0f0a7c7fc6 29:95ebab503ef1
   587   public:
   587   public:
   588 
   588 
   589     ///\name Execution Control
   589     ///\name Execution Control
   590     ///The simplest way to execute the %Dijkstra algorithm is to use
   590     ///The simplest way to execute the %Dijkstra algorithm is to use
   591     ///one of the member functions called \ref run(Node) "run()".\n
   591     ///one of the member functions called \ref run(Node) "run()".\n
   592     ///If you need more control on the execution, first you have to call
   592     ///If you need better control on the execution, you have to call
   593     ///\ref init(), then you can add several source nodes with
   593     ///\ref init() first, then you can add several source nodes with
   594     ///\ref addSource(). Finally the actual path computation can be
   594     ///\ref addSource(). Finally the actual path computation can be
   595     ///performed with one of the \ref start() functions.
   595     ///performed with one of the \ref start() functions.
   596 
   596 
   597     ///@{
   597     ///@{
   598 
   598