COIN-OR::LEMON - Graph Library

Changeset 1177:e41c2907fb49 in lemon-0.x


Ignore:
Timestamp:
02/24/05 18:48:25 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1583
Message:

Fix 'make distcheck' failure.

Files:
3 edited

Legend:

Unmodified
Added
Removed
  • Makefile.am

    r935 r1177  
     1EXTRA_DIST = autopackage/default.apspec.in
     2
    13SUBDIRS = src doc
    24
  • doc/Makefile.am

    r1072 r1177  
    66## htmldir = $(pkgdatadir)/doc
    77
    8 EXTRA_DIST = Doxyfile html coding_style.dox groups.dox mainpage.dox maps.dox
     8EXTRA_DIST = Doxyfile html mainpage.dox getstart.dox quicktour.dox \
     9        demoprograms.dox graphs.dox undir_graphs.dox named-param.dox \
     10        maps.dox coding_style.dox groups.dox namespaces.dox license.dox \
     11        developers_interface.dox graph_io.dox dirs.dox gwrappers.dox
     12
    913
    1014## all-local: html/index.html
  • src/lemon/max_matching.h

    r1172 r1177  
    6060    typedef typename Graph::Node Node;
    6161    typedef typename Graph::Edge Edge;
     62    typedef typename Graph::UndirEdge UndirEdge;
    6263    typedef typename Graph::UndirEdgeIt UndirEdgeIt;
    6364    typedef typename Graph::NodeIt NodeIt;
     
    166167    void readNMapEdge(NMapE& map) {
    167168     for(NodeIt v(g); v!=INVALID; ++v) {
    168         UndirEdge e=map[v];
     169       UndirEdge e=map[v];
    169170        if ( e!=INVALID )
    170171          _mate.set(v,g.oppositeNode(v,e));
Note: See TracChangeset for help on using the changeset viewer.