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