Index: lemon/bits/bezier.h
===================================================================
--- lemon/bits/bezier.h	(revision 157)
+++ lemon/bits/bezier.h	(revision 184)
@@ -33,5 +33,5 @@
 class BezierBase {
 public:
-  typedef Point<double> Point;
+  typedef lemon::dim2::Point<double> Point;
 protected:
   static Point conv(Point x,Point y,double t) {return (1-t)*x+t*y;}
Index: lemon/bits/traits.h
===================================================================
--- lemon/bits/traits.h	(revision 139)
+++ lemon/bits/traits.h	(revision 184)
@@ -151,6 +151,6 @@
     typedef typename Map::Value Value;
 
-    typedef const Value ConstReturnValue;
-    typedef const Value ReturnValue;
+    typedef Value ConstReturnValue;
+    typedef Value ReturnValue;
   };
 
@@ -179,6 +179,6 @@
     typedef typename MatrixMap::Value Value;
 
-    typedef const Value ConstReturnValue;
-    typedef const Value ReturnValue;
+    typedef Value ConstReturnValue;
+    typedef Value ReturnValue;
   };
 
Index: lemon/dijkstra.h
===================================================================
--- lemon/dijkstra.h	(revision 169)
+++ lemon/dijkstra.h	(revision 184)
@@ -24,4 +24,5 @@
 ///\brief Dijkstra algorithm.
 
+#include <limits>
 #include <lemon/list_graph.h>
 #include <lemon/bin_heap.h>
Index: lemon/graph_to_eps.h
===================================================================
--- lemon/graph_to_eps.h	(revision 157)
+++ lemon/graph_to_eps.h	(revision 184)
@@ -1016,5 +1016,5 @@
       else for(ArcIt e(g);e!=INVALID;++e)
 	if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
-	   &&g.source(e)!=g.target(e))
+	   &&g.source(e)!=g.target(e)) {
 	  if(_drawArrows) {
 	    dim2::Point<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);
@@ -1036,5 +1036,5 @@
 	       << _arcColors[e].green() << ' '
 	       << _arcColors[e].blue() << " arr\n";
-	  }
+	  } 
 	  else os << mycoords[g.source(e)].x << ' '
 		  << mycoords[g.source(e)].y << ' '
@@ -1045,4 +1045,5 @@
 		  << _arcColors[e].blue() << ' '
 		  << _arcWidths[e]*_arcWidthScale << " l\n";
+	}
       os << "grestore\n";
     }
Index: lemon/list_graph.h
===================================================================
--- lemon/list_graph.h	(revision 149)
+++ lemon/list_graph.h	(revision 184)
@@ -116,5 +116,5 @@
       for(n = first_node; 
 	  n!=-1 && nodes[n].first_in == -1; 
-	  n = nodes[n].next);
+	  n = nodes[n].next) {}
       arc.id = (n == -1) ? -1 : nodes[n].first_in;
     }
@@ -126,6 +126,6 @@
 	int n;
 	for(n = nodes[arcs[arc.id].target].next;
-	  n!=-1 && nodes[n].first_in == -1; 
-	  n = nodes[n].next);
+	    n!=-1 && nodes[n].first_in == -1; 
+	    n = nodes[n].next) {}
 	arc.id = (n == -1) ? -1 : nodes[n].first_in;
       }      
Index: test/test_tools.h
===================================================================
--- test/test_tools.h	(revision 171)
+++ test/test_tools.h	(revision 184)
@@ -25,4 +25,5 @@
 
 #include <iostream>
+#include <stdlib.h>
 
 ///If \c rc is fail, writes an error message and exits.
@@ -37,6 +38,4 @@
 ///print something like this (and then exits).
 ///\verbatim file_name.cc:123: error: This is obviously false. \endverbatim
-///
-///\todo It should be in \c assert.h
 #define check(rc, msg) \
   if(!(rc)) { \