COIN-OR::LEMON - Graph Library

Changeset 210:81cfc04531e8 in lemon-main for doc/groups.dox


Ignore:
Timestamp:
07/13/08 21:09:47 (16 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
211:542dd614cbb4, 212:1ae84dea7d09, 214:60eecd3fe37a, 216:6d7bfcf5b48e
Phase:
public
Message:

Remove long lines (from all but one file)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r209 r210  
    228228
    229229\f[ 0 \le f_a \le c_a \f]
    230 \f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv} \qquad \forall u \in V \setminus \{s,t\}\f]
     230\f[ \sum_{v\in\delta^{-}(u)}f_{vu}=\sum_{v\in\delta^{+}(u)}f_{uv}
     231\qquad \forall u \in V \setminus \{s,t\}\f]
    231232\f[ \max \sum_{v\in\delta^{+}(s)}f_{uv} - \sum_{v\in\delta^{-}(s)}f_{vu}\f]
    232233
     
    268269cut is the \f$X\f$ solution of the next optimization problem:
    269270
    270 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f]
     271\f[ \min_{X \subset V, X\not\in \{\emptyset, V\}}
     272\sum_{uv\in A, u\in X, v\not\in X}c_{uv}\f]
    271273
    272274LEMON contains several algorithms related to minimum cut problems:
     
    301303\brief Algorithms for planarity checking, embedding and drawing
    302304
    303 This group describes the algorithms for planarity checking, embedding and drawing.
     305This group describes the algorithms for planarity checking,
     306embedding and drawing.
    304307
    305308\image html planar.png
     
    478481\brief Reading and writing \ref lgf-format "Lemon Graph Format".
    479482
    480 This group describes methods for reading and writing \ref lgf-format "Lemon Graph Format".
     483This group describes methods for reading and writing
     484\ref lgf-format "Lemon Graph Format".
    481485*/
    482486
Note: See TracChangeset for help on using the changeset viewer.