COIN-OR::LEMON - Graph Library

Changeset 713:4ac30454f1c1 in lemon-1.2 for lemon/dijkstra.h


Ignore:
Timestamp:
07/24/09 10:27:40 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Small doc improvements

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/dijkstra.h

    r584 r713  
    585585    ///The simplest way to execute the %Dijkstra algorithm is to use
    586586    ///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
    588     ///\ref init(), then you can add several source nodes with
     587    ///If you need better control on the execution, you have to call
     588    ///\ref init() first, then you can add several source nodes with
    589589    ///\ref addSource(). Finally the actual path computation can be
    590590    ///performed with one of the \ref start() functions.
Note: See TracChangeset for help on using the changeset viewer.