Changeset 760:4ac30454f1c1 in lemon for lemon/dijkstra.h

Timestamp:

07/24/09 10:27:40 (16 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Small doc improvements

File:

• lemon/dijkstra.h (modified) (1 diff)

lemon/dijkstra.h

@@ -585 +585 @@
     ///The simplest way to execute the %Dijkstra algorithm is to use
     ///one of the member functions called \ref run(Node) "run()".\n
-    ///If you need more control on the execution, first you have to call
-    ///\ref init(), then you can add several source nodes with
+    ///If you need better control on the execution, you have to call
+    ///\ref init() first, then you can add several source nodes with
     ///\ref addSource(). Finally the actual path computation can be
     ///performed with one of the \ref start() functions.