COIN-OR::LEMON - Graph Library

Changeset 1081:f1398882a928 in lemon for doc


Ignore:
Timestamp:
08/08/11 12:36:16 (8 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
1.1
Phase:
public
Tags:
r1.1.4
Message:

Unify sources

Location:
doc
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r844 r1081  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2011
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    276276This group contains the algorithms for finding shortest paths in digraphs.
    277277
    278  - \ref Dijkstra Dijkstra's algorithm for finding shortest paths from a 
     278 - \ref Dijkstra Dijkstra's algorithm for finding shortest paths from a
    279279   source node when all arc lengths are non-negative.
    280280 - \ref Suurballe A successive shortest path algorithm for finding
     
    307307
    308308
    309 \ref Circulation is a preflow push-relabel algorithm implemented directly 
     309\ref Circulation is a preflow push-relabel algorithm implemented directly
    310310for finding feasible circulations, which is a somewhat different problem,
    311311but it is strongly related to maximum flow.
  • doc/lgf.dox

    r1069 r1081  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2011
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
  • doc/min_cost_flow.dox

    r710 r1081  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2011
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    8282   - if \f$\sum_{uv\in A} f(uv) - \sum_{vu\in A} f(vu) \neq sup(u)\f$,
    8383     then \f$\pi(u)=0\f$.
    84  
     84
    8585Here \f$cost^\pi(uv)\f$ denotes the \e reduced \e cost of the arc
    8686\f$uv\in A\f$ with respect to the potential function \f$\pi\f$, i.e.
     
    120120\f[ lower(uv) \leq f(uv) \leq upper(uv) \quad \forall uv\in A \f]
    121121
    122 It means that the total demand must be less or equal to the 
     122It means that the total demand must be less or equal to the
    123123total supply (i.e. \f$\sum_{u\in V} sup(u)\f$ must be zero or
    124124positive) and all the demands have to be satisfied, but there
Note: See TracChangeset for help on using the changeset viewer.