1.1 --- a/lemon/graph_to_eps.h	Thu Jan 26 15:42:13 2006 +0000
     1.2 +++ b/lemon/graph_to_eps.h	Thu Jan 26 16:24:40 2006 +0000
     1.3 @@ -234,7 +234,8 @@
     1.4    ConstMap<typename Graph::Node,bool > _nodePsTexts;  
     1.5    char *_nodePsTextsPreamble;
     1.6    
     1.7 -  bool _u;
     1.8 +  bool _undirected;
     1.9 +
    1.10    bool _pleaseRemoveOsStream;
    1.11  
    1.12    bool _scaleToA4;
    1.13 @@ -272,7 +273,7 @@
    1.14      _enableParallel(false), _parEdgeDist(1),
    1.15      _showNodeText(false), _nodeTexts(false), _nodeTextSize(1),
    1.16      _showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0),
    1.17 -    _u(false),
    1.18 +    _undirected(false),
    1.19      _pleaseRemoveOsStream(_pros), _scaleToA4(false),
    1.20      _nodeTextColorType(SAME_COL), _nodeTextColors(Color(0,0,0)),
    1.21      _autoNodeScale(false),
    1.22 @@ -329,7 +330,8 @@
    1.23    using T::_nodePsTexts;  
    1.24    using T::_nodePsTextsPreamble;
    1.25    
    1.26 -  using T::_u;
    1.27 +  using T::_undirected;
    1.28 +
    1.29    using T::_pleaseRemoveOsStream;
    1.30  
    1.31    using T::_scaleToA4;
    1.32 @@ -734,12 +736,13 @@
    1.33  
    1.34    ///Sets whether the the graph is undirected
    1.35    ///
    1.36 -  GraphToEps<T> &u(bool b=true) {_u=b;return *this;}
    1.37 +  GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;}
    1.38 +
    1.39    ///Sets whether the the graph is directed
    1.40  
    1.41    ///Sets whether the the graph is directed.
    1.42    ///Use it to show the undirected edges as a pair of directed ones.
    1.43 -  GraphToEps<T> &bidir(bool b=true) {_u=!b;return *this;}
    1.44 +  GraphToEps<T> &bidir(bool b=true) {_undirected=!b;return *this;}
    1.45  
    1.46    ///Sets the title.
    1.47  
    1.48 @@ -958,7 +961,7 @@
    1.49        if(_enableParallel) {
    1.50  	std::vector<Edge> el;
    1.51  	for(EdgeIt e(g);e!=INVALID;++e)
    1.52 -	  if((!_u||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
    1.53 +	  if((!_undirected||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
    1.54  	    el.push_back(e);
    1.55  	std::sort(el.begin(),el.end(),edgeLess(g));
    1.56  	
    1.57 @@ -1046,7 +1049,7 @@
    1.58  	}
    1.59        }
    1.60        else for(EdgeIt e(g);e!=INVALID;++e)
    1.61 -	if((!_u||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
    1.62 +	if((!_undirected||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
    1.63  	  if(_drawArrows) {
    1.64  	    xy<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);
    1.65  	    double rn=_nodeSizes[g.target(e)]*_nodeScale;