COIN-OR::LEMON - Graph Library

Changeset 2377:83775fab25dc in lemon-0.x


Ignore:
Timestamp:
02/21/07 14:49:19 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3196
Message:

Minor changes

Files:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r2376 r2377  
    152152\brief This group describes the algorithms for finding maximum flows.
    153153
    154 This group describes the algorithms for finding maximum flows.
     154This group describes the algorithms for finding maximum flows and
     155feasible circulations.
    155156
    156157\image html flow.png
  • lemon/csp.h

    r2376 r2377  
    3636#include <lemon/counter.h>
    3737namespace lemon {
     38
     39  ///\ingroup approx
    3840 
    3941  ///Algorithms for the Resource Constrained Shortest Path Problem
Note: See TracChangeset for help on using the changeset viewer.