1.1 --- a/src/lemon/graph_to_eps.h	Mon Apr 18 14:18:12 2005 +0000
     1.2 +++ b/src/lemon/graph_to_eps.h	Mon Apr 18 14:59:24 2005 +0000
     1.3 @@ -363,10 +363,10 @@
     1.4      edgeLess(const Graph &_g) : g(_g) {}
     1.5      bool operator()(Edge a,Edge b) const 
     1.6      {
     1.7 -      Node ai=min(g.source(a),g.target(a));
     1.8 -      Node aa=max(g.source(a),g.target(a));
     1.9 -      Node bi=min(g.source(b),g.target(b));
    1.10 -      Node ba=max(g.source(b),g.target(b));
    1.11 +      Node ai=std::min(g.source(a),g.target(a));
    1.12 +      Node aa=std::max(g.source(a),g.target(a));
    1.13 +      Node bi=std::min(g.source(b),g.target(b));
    1.14 +      Node ba=std::max(g.source(b),g.target(b));
    1.15        return ai<bi ||
    1.16  	(ai==bi && (aa < ba || 
    1.17  		    (aa==ba && ai==g.source(a) && bi==g.target(b))));