COIN-OR::LEMON - Graph Library

Changeset 1910:f95eea8c34b0 in lemon-0.x for lemon/graph_to_eps.h


Ignore:
Timestamp:
01/26/06 17:24:40 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2485
Message:

Bipartite => Bp
Upper => A
Lower => B

+ some bug fix

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/graph_to_eps.h

    r1909 r1910  
    235235  char *_nodePsTextsPreamble;
    236236 
    237   bool _u;
     237  bool _undirected;
     238
    238239  bool _pleaseRemoveOsStream;
    239240
     
    273274    _showNodeText(false), _nodeTexts(false), _nodeTextSize(1),
    274275    _showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0),
    275     _u(false),
     276    _undirected(false),
    276277    _pleaseRemoveOsStream(_pros), _scaleToA4(false),
    277278    _nodeTextColorType(SAME_COL), _nodeTextColors(Color(0,0,0)),
     
    330331  using T::_nodePsTextsPreamble;
    331332 
    332   using T::_u;
     333  using T::_undirected;
     334
    333335  using T::_pleaseRemoveOsStream;
    334336
     
    735737  ///Sets whether the the graph is undirected
    736738  ///
    737   GraphToEps<T> &u(bool b=true) {_u=b;return *this;}
     739  GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;}
     740
    738741  ///Sets whether the the graph is directed
    739742
    740743  ///Sets whether the the graph is directed.
    741744  ///Use it to show the undirected edges as a pair of directed ones.
    742   GraphToEps<T> &bidir(bool b=true) {_u=!b;return *this;}
     745  GraphToEps<T> &bidir(bool b=true) {_undirected=!b;return *this;}
    743746
    744747  ///Sets the title.
     
    959962        std::vector<Edge> el;
    960963        for(EdgeIt e(g);e!=INVALID;++e)
    961           if((!_u||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
     964          if((!_undirected||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
    962965            el.push_back(e);
    963966        std::sort(el.begin(),el.end(),edgeLess(g));
     
    10471050      }
    10481051      else for(EdgeIt e(g);e!=INVALID;++e)
    1049         if((!_u||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
     1052        if((!_undirected||g.source(e)<g.target(e))&&_edgeWidths[e]>0)
    10501053          if(_drawArrows) {
    10511054            xy<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);
Note: See TracChangeset for help on using the changeset viewer.