1.1 --- a/lemon/graph_to_eps.h	Mon Sep 22 10:56:01 2008 +0200
     1.2 +++ b/lemon/graph_to_eps.h	Mon Jul 14 15:23:11 2008 +0100
     1.3 @@ -666,7 +666,6 @@
     1.4    ///this function calls the algorithm itself, i.e. in this case
     1.5    ///it draws the graph.
     1.6    void run() {
     1.7 -    //\todo better 'epsilon' would be nice here.
     1.8      const double EPSILON=1e-9;
     1.9      if(dontPrint) return;
    1.10  
    1.11 @@ -707,7 +706,6 @@
    1.12        double max_w=0;
    1.13        for(ArcIt e(g);e!=INVALID;++e)
    1.14          max_w=std::max(double(_arcWidths[e]),max_w);
    1.15 -      //\todo better 'epsilon' would be nice here.
    1.16        if(max_w>EPSILON) {
    1.17          _arcWidthScale/=max_w;
    1.18        }
    1.19 @@ -717,7 +715,6 @@
    1.20        double max_s=0;
    1.21        for(NodeIt n(g);n!=INVALID;++n)
    1.22          max_s=std::max(double(_nodeSizes[n]),max_s);
    1.23 -      //\todo better 'epsilon' would be nice here.
    1.24        if(max_s>EPSILON) {
    1.25          _nodeScale/=max_s;
    1.26        }
    1.27 @@ -873,7 +870,6 @@
    1.28             << -bb.left() << ' ' << -bb.bottom() << " translate\n";
    1.29        }
    1.30        else {
    1.31 -        //\todo Verify centering
    1.32          double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
    1.33                    (A4WIDTH-2*A4BORDER)/bb.height());
    1.34          os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' '
    1.35 @@ -906,7 +902,6 @@
    1.36            dim2::Point<double>
    1.37              dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]);
    1.38            double l=std::sqrt(dvec.normSquare());
    1.39 -          //\todo better 'epsilon' would be nice here.
    1.40            dim2::Point<double> d(dvec/std::max(l,EPSILON));
    1.41            dim2::Point<double> m;
    1.42  //           m=dim2::Point<double>(mycoords[g.target(*i)]+