COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
11/27/07 16:41:43 (16 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3398
Message:

Performance bug in Preflow
The initial relabeling moved each node to the lowest level
Doc bug fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/dinitz_sleator_tarjan.h

    r2519 r2522  
    702702    /// @}
    703703
    704     /// \name Query Functions
    705     /// The result of the %Dijkstra algorithm can be obtained using these
    706     /// functions.\n
     704    /// \name Query Functions
     705    /// The result of the Dinitz-Sleator-Tarjan algorithm can be
     706    /// obtained using these functions.
     707    /// \n
    707708    /// Before the use of these functions,
    708709    /// either run() or start() must be called.
Note: See TracChangeset for help on using the changeset viewer.