[Lemon-commits] [lemon_svn] alpar: r1583 - in hugo/trunk: . doc src/lemon

[Lemon SVN]

Author: alpar
Date: Thu Feb 24 18:48:25 2005
New Revision: 1583

Modified:
   hugo/trunk/Makefile.am
   hugo/trunk/doc/Makefile.am
   hugo/trunk/src/lemon/max_matching.h

Log:
Fix 'make distcheck' failure.

Modified: hugo/trunk/Makefile.am
==============================================================================
--- hugo/trunk/Makefile.am	(original)
+++ hugo/trunk/Makefile.am	Thu Feb 24 18:48:25 2005
@@ -1,3 +1,5 @@
+EXTRA_DIST = autopackage/default.apspec.in
+
 SUBDIRS = src doc
 
 MRPROPERFILES =								\

Modified: hugo/trunk/doc/Makefile.am
==============================================================================
--- hugo/trunk/doc/Makefile.am	(original)
+++ hugo/trunk/doc/Makefile.am	Thu Feb 24 18:48:25 2005
@@ -5,7 +5,11 @@
 htmldir = $(datadir)/doc/@PACKAGE at -@VERSION@/html
 ## htmldir = $(pkgdatadir)/doc
 
-EXTRA_DIST = Doxyfile html coding_style.dox groups.dox mainpage.dox maps.dox
+EXTRA_DIST = Doxyfile html mainpage.dox getstart.dox quicktour.dox \
+	demoprograms.dox graphs.dox undir_graphs.dox named-param.dox \
+        maps.dox coding_style.dox groups.dox namespaces.dox license.dox \
+	developers_interface.dox graph_io.dox dirs.dox gwrappers.dox
+
 
 ## all-local: html/index.html
 

Modified: hugo/trunk/src/lemon/max_matching.h
==============================================================================
--- hugo/trunk/src/lemon/max_matching.h	(original)
+++ hugo/trunk/src/lemon/max_matching.h	Thu Feb 24 18:48:25 2005
@@ -59,6 +59,7 @@
 
     typedef typename Graph::Node Node;
     typedef typename Graph::Edge Edge;
+    typedef typename Graph::UndirEdge UndirEdge;
     typedef typename Graph::UndirEdgeIt UndirEdgeIt;
     typedef typename Graph::NodeIt NodeIt;
     typedef typename Graph::IncEdgeIt IncEdgeIt;
@@ -165,7 +166,7 @@
     template<typename NMapE>
     void readNMapEdge(NMapE& map) {
      for(NodeIt v(g); v!=INVALID; ++v) {
-	UndirEdge e=map[v];
+       UndirEdge e=map[v];
 	if ( e!=INVALID )
 	  _mate.set(v,g.oppositeNode(v,e));
       }