COIN-OR::LEMON - Graph Library

Changeset 2042:bdc953f2a449 in lemon-0.x for demo


Ignore:
Timestamp:
04/07/06 11:54:35 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2681
Message:

New Algorithm group for matchings

LaTeX formulas
Bug fix => /\f$ will cause parsing error in doxygen

File:
1 edited

Legend:

Unmodified
Added
Removed
  • demo/tight_edge_filter_map.h

    r1956 r2042  
    3333    edge-distance.
    3434   
    35     Let \f$G=(V,A)\f$ be a directed graph (graph for short) and
    36     let \f$\mathbb{F}\f$ be a number type.
     35    Let \f$ G=(V,A) \f$ be a directed graph (graph for short) and
     36    let \f$ \mathbb{F} \f$ be a number type.
    3737    Given a distance function
    38     \f$d:E\to\mathbb{F}\f$,
    39     \f$\pi:V\to\mathbb{F}\f$ is said to be a potetial
    40     w.r.t. \f$d\f$
     38    \f$ d:E\to\mathbb{F} \f$,
     39    \f$ \pi:V\to\mathbb{F} \f$ is said to be a potetial
     40    w.r.t. \f$ d \f$
    4141    if and only if
    42     \f$\pi(v)\le d(uv)+\pi(u)\f$ holds for each edge \f$uv\in E\f$
     42    \f$ \pi(v)\le d(uv)+\pi(u) \f$ holds for each edge \f$ uv\in E \f$
    4343    (or the reverse inequality holds for each edge).
    4444    An edge is said to be tight if this inequality holds with equality,
Note: See TracChangeset for help on using the changeset viewer.