lemon/graph_to_eps.h
author Alpar Juttner <alpar@cs.elte.hu>
Sun, 13 Jul 2008 16:46:56 +0100
changeset 208 4317d277ba21
parent 184 716b220697a0
child 209 765619b7cbb2
permissions -rw-r--r--
Better source unifier

- now it is called scripts/unify-sources.sh
- replaces each tab with 8 spaces
- remove trailing spaces (and tabs)
- warnings on long lines (i.e. on lines that are more than 80 characters)
- the standard file header now turns off the space-to-tab replacement in Emacs
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2008
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 
    19 #ifndef LEMON_GRAPH_TO_EPS_H
    20 #define LEMON_GRAPH_TO_EPS_H
    21 
    22 #include<iostream>
    23 #include<fstream>
    24 #include<sstream>
    25 #include<algorithm>
    26 #include<vector>
    27 
    28 #ifndef WIN32
    29 #include<sys/time.h>
    30 #include<ctime>
    31 #else
    32 #define WIN32_LEAN_AND_MEAN
    33 #define NOMINMAX
    34 #include<windows.h>
    35 #endif
    36 
    37 #include<lemon/math.h>
    38 #include<lemon/bits/invalid.h>
    39 #include<lemon/dim2.h>
    40 #include<lemon/maps.h>
    41 #include<lemon/color.h>
    42 #include<lemon/bits/bezier.h>
    43 
    44 
    45 ///\ingroup eps_io
    46 ///\file
    47 ///\brief A well configurable tool for visualizing graphs
    48 
    49 namespace lemon {
    50 
    51   namespace _graph_to_eps_bits {
    52     template<class MT>
    53     class _NegY {
    54     public:
    55       typedef typename MT::Key Key;
    56       typedef typename MT::Value Value;
    57       const MT &map;
    58       int yscale;
    59       _NegY(const MT &m,bool b) : map(m), yscale(1-b*2) {}
    60       Value operator[](Key n) { return Value(map[n].x,map[n].y*yscale);}
    61     };
    62   }
    63   
    64 ///Default traits class of \ref GraphToEps
    65 
    66 ///Default traits class of \ref GraphToEps.
    67 ///
    68 ///\c G is the type of the underlying graph.
    69 template<class G>
    70 struct DefaultGraphToEpsTraits
    71 {
    72   typedef G Graph;
    73   typedef typename Graph::Node Node;
    74   typedef typename Graph::NodeIt NodeIt;
    75   typedef typename Graph::Arc Arc;
    76   typedef typename Graph::ArcIt ArcIt;
    77   typedef typename Graph::InArcIt InArcIt;
    78   typedef typename Graph::OutArcIt OutArcIt;
    79   
    80 
    81   const Graph &g;
    82 
    83   std::ostream& os;
    84   
    85   typedef ConstMap<typename Graph::Node,dim2::Point<double> > CoordsMapType;
    86   CoordsMapType _coords;
    87   ConstMap<typename Graph::Node,double > _nodeSizes;
    88   ConstMap<typename Graph::Node,int > _nodeShapes;
    89 
    90   ConstMap<typename Graph::Node,Color > _nodeColors;
    91   ConstMap<typename Graph::Arc,Color > _arcColors;
    92 
    93   ConstMap<typename Graph::Arc,double > _arcWidths;
    94 
    95   double _arcWidthScale;
    96   
    97   double _nodeScale;
    98   double _xBorder, _yBorder;
    99   double _scale;
   100   double _nodeBorderQuotient;
   101   
   102   bool _drawArrows;
   103   double _arrowLength, _arrowWidth;
   104   
   105   bool _showNodes, _showArcs;
   106 
   107   bool _enableParallel;
   108   double _parArcDist;
   109 
   110   bool _showNodeText;
   111   ConstMap<typename Graph::Node,bool > _nodeTexts;  
   112   double _nodeTextSize;
   113 
   114   bool _showNodePsText;
   115   ConstMap<typename Graph::Node,bool > _nodePsTexts;  
   116   char *_nodePsTextsPreamble;
   117   
   118   bool _undirected;
   119 
   120   bool _pleaseRemoveOsStream;
   121 
   122   bool _scaleToA4;
   123 
   124   std::string _title;
   125   std::string _copyright;
   126 
   127   enum NodeTextColorType 
   128     { DIST_COL=0, DIST_BW=1, CUST_COL=2, SAME_COL=3 } _nodeTextColorType;
   129   ConstMap<typename Graph::Node,Color > _nodeTextColors;
   130 
   131   bool _autoNodeScale;
   132   bool _autoArcWidthScale;
   133 
   134   bool _absoluteNodeSizes;
   135   bool _absoluteArcWidths;
   136 
   137   bool _negY;
   138 
   139   bool _preScale;
   140   ///Constructor
   141 
   142   ///Constructor
   143   ///\param _g  Reference to the graph to be printed.
   144   ///\param _os Reference to the output stream.
   145   ///\param _os Reference to the output stream. By default it is <tt>std::cout</tt>.
   146   ///\param _pros If it is \c true, then the \c ostream referenced by \c _os
   147   ///will be explicitly deallocated by the destructor.
   148   DefaultGraphToEpsTraits(const G &_g,std::ostream& _os=std::cout,
   149 			  bool _pros=false) :
   150     g(_g), os(_os),
   151     _coords(dim2::Point<double>(1,1)), _nodeSizes(1), _nodeShapes(0),
   152     _nodeColors(WHITE), _arcColors(BLACK),
   153     _arcWidths(1.0), _arcWidthScale(0.003),
   154     _nodeScale(.01), _xBorder(10), _yBorder(10), _scale(1.0),
   155     _nodeBorderQuotient(.1),
   156     _drawArrows(false), _arrowLength(1), _arrowWidth(0.3),
   157     _showNodes(true), _showArcs(true),
   158     _enableParallel(false), _parArcDist(1),
   159     _showNodeText(false), _nodeTexts(false), _nodeTextSize(1),
   160     _showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0),
   161     _undirected(lemon::UndirectedTagIndicator<G>::value),
   162     _pleaseRemoveOsStream(_pros), _scaleToA4(false),
   163     _nodeTextColorType(SAME_COL), _nodeTextColors(BLACK),
   164     _autoNodeScale(false),
   165     _autoArcWidthScale(false),
   166     _absoluteNodeSizes(false),
   167     _absoluteArcWidths(false),
   168     _negY(false),
   169     _preScale(true)
   170   {}
   171 };
   172 
   173 ///Auxiliary class to implement the named parameters of \ref graphToEps()
   174 
   175 ///Auxiliary class to implement the named parameters of \ref graphToEps().
   176 ///
   177 ///For detailed examples see the \ref graph_to_eps_demo.cc demo file.
   178 template<class T> class GraphToEps : public T 
   179 {
   180   // Can't believe it is required by the C++ standard
   181   using T::g;
   182   using T::os;
   183 
   184   using T::_coords;
   185   using T::_nodeSizes;
   186   using T::_nodeShapes;
   187   using T::_nodeColors;
   188   using T::_arcColors;
   189   using T::_arcWidths;
   190 
   191   using T::_arcWidthScale;
   192   using T::_nodeScale;
   193   using T::_xBorder;
   194   using T::_yBorder;
   195   using T::_scale;
   196   using T::_nodeBorderQuotient;
   197   
   198   using T::_drawArrows;
   199   using T::_arrowLength;
   200   using T::_arrowWidth;
   201   
   202   using T::_showNodes;
   203   using T::_showArcs;
   204 
   205   using T::_enableParallel;
   206   using T::_parArcDist;
   207 
   208   using T::_showNodeText;
   209   using T::_nodeTexts;  
   210   using T::_nodeTextSize;
   211 
   212   using T::_showNodePsText;
   213   using T::_nodePsTexts;  
   214   using T::_nodePsTextsPreamble;
   215   
   216   using T::_undirected;
   217 
   218   using T::_pleaseRemoveOsStream;
   219 
   220   using T::_scaleToA4;
   221 
   222   using T::_title;
   223   using T::_copyright;
   224 
   225   using T::NodeTextColorType;
   226   using T::CUST_COL;
   227   using T::DIST_COL;
   228   using T::DIST_BW;
   229   using T::_nodeTextColorType;
   230   using T::_nodeTextColors;
   231 
   232   using T::_autoNodeScale;
   233   using T::_autoArcWidthScale;
   234 
   235   using T::_absoluteNodeSizes;
   236   using T::_absoluteArcWidths;
   237 
   238 
   239   using T::_negY;
   240   using T::_preScale;
   241 
   242   // dradnats ++C eht yb deriuqer si ti eveileb t'naC
   243 
   244   typedef typename T::Graph Graph;
   245   typedef typename Graph::Node Node;
   246   typedef typename Graph::NodeIt NodeIt;
   247   typedef typename Graph::Arc Arc;
   248   typedef typename Graph::ArcIt ArcIt;
   249   typedef typename Graph::InArcIt InArcIt;
   250   typedef typename Graph::OutArcIt OutArcIt;
   251 
   252   static const int INTERPOL_PREC;
   253   static const double A4HEIGHT;
   254   static const double A4WIDTH;
   255   static const double A4BORDER;
   256 
   257   bool dontPrint;
   258 
   259 public:
   260   ///Node shapes
   261 
   262   ///Node shapes.
   263   ///
   264   enum NodeShapes { 
   265     /// = 0
   266     ///\image html nodeshape_0.png
   267     ///\image latex nodeshape_0.eps "CIRCLE shape (0)" width=2cm
   268     CIRCLE=0, 
   269     /// = 1
   270     ///\image html nodeshape_1.png
   271     ///\image latex nodeshape_1.eps "SQUARE shape (1)" width=2cm
   272     ///
   273     SQUARE=1, 
   274     /// = 2
   275     ///\image html nodeshape_2.png
   276     ///\image latex nodeshape_2.eps "DIAMOND shape (2)" width=2cm
   277     ///
   278     DIAMOND=2,
   279     /// = 3
   280     ///\image html nodeshape_3.png
   281     ///\image latex nodeshape_2.eps "MALE shape (4)" width=2cm
   282     ///
   283     MALE=3,
   284     /// = 4
   285     ///\image html nodeshape_4.png
   286     ///\image latex nodeshape_2.eps "FEMALE shape (4)" width=2cm
   287     ///
   288     FEMALE=4
   289   };
   290 
   291 private:
   292   class arcLess {
   293     const Graph &g;
   294   public:
   295     arcLess(const Graph &_g) : g(_g) {}
   296     bool operator()(Arc a,Arc b) const 
   297     {
   298       Node ai=std::min(g.source(a),g.target(a));
   299       Node aa=std::max(g.source(a),g.target(a));
   300       Node bi=std::min(g.source(b),g.target(b));
   301       Node ba=std::max(g.source(b),g.target(b));
   302       return ai<bi ||
   303 	(ai==bi && (aa < ba || 
   304 		    (aa==ba && ai==g.source(a) && bi==g.target(b))));
   305     }
   306   };
   307   bool isParallel(Arc e,Arc f) const
   308   {
   309     return (g.source(e)==g.source(f)&&
   310 	    g.target(e)==g.target(f)) ||
   311       (g.source(e)==g.target(f)&&
   312        g.target(e)==g.source(f));
   313   }
   314   template<class TT>
   315   static std::string psOut(const dim2::Point<TT> &p) 
   316     {
   317       std::ostringstream os;	
   318       os << p.x << ' ' << p.y;
   319       return os.str();
   320     }
   321   static std::string psOut(const Color &c) 
   322     {
   323       std::ostringstream os;	
   324       os << c.red() << ' ' << c.green() << ' ' << c.blue();
   325       return os.str();
   326     }
   327   
   328 public:
   329   GraphToEps(const T &t) : T(t), dontPrint(false) {};
   330   
   331   template<class X> struct CoordsTraits : public T {
   332   typedef X CoordsMapType;
   333     const X &_coords;
   334     CoordsTraits(const T &t,const X &x) : T(t), _coords(x) {}
   335   };
   336   ///Sets the map of the node coordinates
   337 
   338   ///Sets the map of the node coordinates.
   339   ///\param x must be a node map with \ref dim2::Point "dim2::Point<double>" or
   340   ///\ref dim2::Point "dim2::Point<int>" values. 
   341   template<class X> GraphToEps<CoordsTraits<X> > coords(const X &x) {
   342     dontPrint=true;
   343     return GraphToEps<CoordsTraits<X> >(CoordsTraits<X>(*this,x));
   344   }
   345   template<class X> struct NodeSizesTraits : public T {
   346     const X &_nodeSizes;
   347     NodeSizesTraits(const T &t,const X &x) : T(t), _nodeSizes(x) {}
   348   };
   349   ///Sets the map of the node sizes
   350 
   351   ///Sets the map of the node sizes.
   352   ///\param x must be a node map with \c double (or convertible) values. 
   353   template<class X> GraphToEps<NodeSizesTraits<X> > nodeSizes(const X &x)
   354   {
   355     dontPrint=true;
   356     return GraphToEps<NodeSizesTraits<X> >(NodeSizesTraits<X>(*this,x));
   357   }
   358   template<class X> struct NodeShapesTraits : public T {
   359     const X &_nodeShapes;
   360     NodeShapesTraits(const T &t,const X &x) : T(t), _nodeShapes(x) {}
   361   };
   362   ///Sets the map of the node shapes
   363 
   364   ///Sets the map of the node shapes.
   365   ///The available shape values
   366   ///can be found in \ref NodeShapes "enum NodeShapes".
   367   ///\param x must be a node map with \c int (or convertible) values. 
   368   ///\sa NodeShapes
   369   template<class X> GraphToEps<NodeShapesTraits<X> > nodeShapes(const X &x)
   370   {
   371     dontPrint=true;
   372     return GraphToEps<NodeShapesTraits<X> >(NodeShapesTraits<X>(*this,x));
   373   }
   374   template<class X> struct NodeTextsTraits : public T {
   375     const X &_nodeTexts;
   376     NodeTextsTraits(const T &t,const X &x) : T(t), _nodeTexts(x) {}
   377   };
   378   ///Sets the text printed on the nodes
   379 
   380   ///Sets the text printed on the nodes.
   381   ///\param x must be a node map with type that can be pushed to a standard
   382   ///\c ostream. 
   383   template<class X> GraphToEps<NodeTextsTraits<X> > nodeTexts(const X &x)
   384   {
   385     dontPrint=true;
   386     _showNodeText=true;
   387     return GraphToEps<NodeTextsTraits<X> >(NodeTextsTraits<X>(*this,x));
   388   }
   389   template<class X> struct NodePsTextsTraits : public T {
   390     const X &_nodePsTexts;
   391     NodePsTextsTraits(const T &t,const X &x) : T(t), _nodePsTexts(x) {}
   392   };
   393   ///Inserts a PostScript block to the nodes
   394 
   395   ///With this command it is possible to insert a verbatim PostScript
   396   ///block to the nodes.
   397   ///The PS current point will be moved to the center of the node before
   398   ///the PostScript block inserted.
   399   ///
   400   ///Before and after the block a newline character is inserted so you
   401   ///don't have to bother with the separators.
   402   ///
   403   ///\param x must be a node map with type that can be pushed to a standard
   404   ///\c ostream.
   405   ///
   406   ///\sa nodePsTextsPreamble()
   407   template<class X> GraphToEps<NodePsTextsTraits<X> > nodePsTexts(const X &x)
   408   {
   409     dontPrint=true;
   410     _showNodePsText=true;
   411     return GraphToEps<NodePsTextsTraits<X> >(NodePsTextsTraits<X>(*this,x));
   412   }
   413   template<class X> struct ArcWidthsTraits : public T {
   414     const X &_arcWidths;
   415     ArcWidthsTraits(const T &t,const X &x) : T(t), _arcWidths(x) {}
   416   };
   417   ///Sets the map of the arc widths
   418 
   419   ///Sets the map of the arc widths.
   420   ///\param x must be an arc map with \c double (or convertible) values. 
   421   template<class X> GraphToEps<ArcWidthsTraits<X> > arcWidths(const X &x)
   422   {
   423     dontPrint=true;
   424     return GraphToEps<ArcWidthsTraits<X> >(ArcWidthsTraits<X>(*this,x));
   425   }
   426 
   427   template<class X> struct NodeColorsTraits : public T {
   428     const X &_nodeColors;
   429     NodeColorsTraits(const T &t,const X &x) : T(t), _nodeColors(x) {}
   430   };
   431   ///Sets the map of the node colors
   432 
   433   ///Sets the map of the node colors.
   434   ///\param x must be a node map with \ref Color values.
   435   ///
   436   ///\sa Palette
   437   template<class X> GraphToEps<NodeColorsTraits<X> >
   438   nodeColors(const X &x)
   439   {
   440     dontPrint=true;
   441     return GraphToEps<NodeColorsTraits<X> >(NodeColorsTraits<X>(*this,x));
   442   }
   443   template<class X> struct NodeTextColorsTraits : public T {
   444     const X &_nodeTextColors;
   445     NodeTextColorsTraits(const T &t,const X &x) : T(t), _nodeTextColors(x) {}
   446   };
   447   ///Sets the map of the node text colors
   448 
   449   ///Sets the map of the node text colors.
   450   ///\param x must be a node map with \ref Color values. 
   451   ///
   452   ///\sa Palette
   453   template<class X> GraphToEps<NodeTextColorsTraits<X> >
   454   nodeTextColors(const X &x)
   455   {
   456     dontPrint=true;
   457     _nodeTextColorType=CUST_COL;
   458     return GraphToEps<NodeTextColorsTraits<X> >
   459       (NodeTextColorsTraits<X>(*this,x));
   460   }
   461   template<class X> struct ArcColorsTraits : public T {
   462     const X &_arcColors;
   463     ArcColorsTraits(const T &t,const X &x) : T(t), _arcColors(x) {}
   464   };
   465   ///Sets the map of the arc colors
   466 
   467   ///Sets the map of the arc colors.
   468   ///\param x must be an arc map with \ref Color values. 
   469   ///
   470   ///\sa Palette
   471   template<class X> GraphToEps<ArcColorsTraits<X> >
   472   arcColors(const X &x)
   473   {
   474     dontPrint=true;
   475     return GraphToEps<ArcColorsTraits<X> >(ArcColorsTraits<X>(*this,x));
   476   }
   477   ///Sets a global scale factor for node sizes
   478 
   479   ///Sets a global scale factor for node sizes.
   480   /// 
   481   /// If nodeSizes() is not given, this function simply sets the node
   482   /// sizes to \c d.  If nodeSizes() is given, but
   483   /// autoNodeScale() is not, then the node size given by
   484   /// nodeSizes() will be multiplied by the value \c d.
   485   /// If both nodeSizes() and autoNodeScale() are used, then the
   486   /// node sizes will be scaled in such a way that the greatest size will be
   487   /// equal to \c d.
   488   /// \sa nodeSizes()
   489   /// \sa autoNodeScale()
   490   GraphToEps<T> &nodeScale(double d=.01) {_nodeScale=d;return *this;}
   491   ///Turns on/off the automatic node size scaling.
   492 
   493   ///Turns on/off the automatic node size scaling.
   494   ///
   495   ///\sa nodeScale()
   496   ///
   497   GraphToEps<T> &autoNodeScale(bool b=true) {
   498     _autoNodeScale=b;return *this;
   499   }
   500 
   501   ///Turns on/off the absolutematic node size scaling.
   502 
   503   ///Turns on/off the absolutematic node size scaling.
   504   ///
   505   ///\sa nodeScale()
   506   ///
   507   GraphToEps<T> &absoluteNodeSizes(bool b=true) {
   508     _absoluteNodeSizes=b;return *this;
   509   }
   510 
   511   ///Negates the Y coordinates.
   512   GraphToEps<T> &negateY(bool b=true) {
   513     _negY=b;return *this;
   514   }
   515 
   516   ///Turn on/off pre-scaling
   517 
   518   ///By default graphToEps() rescales the whole image in order to avoid
   519   ///very big or very small bounding boxes.
   520   ///
   521   ///This (p)rescaling can be turned off with this function.
   522   ///
   523   GraphToEps<T> &preScale(bool b=true) {
   524     _preScale=b;return *this;
   525   }
   526 
   527   ///Sets a global scale factor for arc widths
   528 
   529   /// Sets a global scale factor for arc widths.
   530   ///
   531   /// If arcWidths() is not given, this function simply sets the arc
   532   /// widths to \c d.  If arcWidths() is given, but
   533   /// autoArcWidthScale() is not, then the arc withs given by
   534   /// arcWidths() will be multiplied by the value \c d.
   535   /// If both arcWidths() and autoArcWidthScale() are used, then the
   536   /// arc withs will be scaled in such a way that the greatest width will be
   537   /// equal to \c d.
   538   GraphToEps<T> &arcWidthScale(double d=.003) {_arcWidthScale=d;return *this;}
   539   ///Turns on/off the automatic arc width scaling.
   540 
   541   ///Turns on/off the automatic arc width scaling.
   542   ///
   543   ///\sa arcWidthScale()
   544   ///
   545   GraphToEps<T> &autoArcWidthScale(bool b=true) {
   546     _autoArcWidthScale=b;return *this;
   547   }
   548   ///Turns on/off the absolutematic arc width scaling.
   549 
   550   ///Turns on/off the absolutematic arc width scaling.
   551   ///
   552   ///\sa arcWidthScale()
   553   ///
   554   GraphToEps<T> &absoluteArcWidths(bool b=true) {
   555     _absoluteArcWidths=b;return *this;
   556   }
   557   ///Sets a global scale factor for the whole picture
   558   GraphToEps<T> &scale(double d) {_scale=d;return *this;}
   559   ///Sets the width of the border around the picture
   560   GraphToEps<T> &border(double b=10) {_xBorder=_yBorder=b;return *this;}
   561   ///Sets the width of the border around the picture
   562   GraphToEps<T> &border(double x, double y) {
   563     _xBorder=x;_yBorder=y;return *this;
   564   }
   565   ///Sets whether to draw arrows
   566   GraphToEps<T> &drawArrows(bool b=true) {_drawArrows=b;return *this;}
   567   ///Sets the length of the arrowheads
   568   GraphToEps<T> &arrowLength(double d=1.0) {_arrowLength*=d;return *this;}
   569   ///Sets the width of the arrowheads
   570   GraphToEps<T> &arrowWidth(double d=.3) {_arrowWidth*=d;return *this;}
   571   
   572   ///Scales the drawing to fit to A4 page
   573   GraphToEps<T> &scaleToA4() {_scaleToA4=true;return *this;}
   574   
   575   ///Enables parallel arcs
   576   GraphToEps<T> &enableParallel(bool b=true) {_enableParallel=b;return *this;}
   577   
   578   ///Sets the distance between parallel arcs
   579   GraphToEps<T> &parArcDist(double d) {_parArcDist*=d;return *this;}
   580   
   581   ///Hides the arcs
   582   GraphToEps<T> &hideArcs(bool b=true) {_showArcs=!b;return *this;}
   583   ///Hides the nodes
   584   GraphToEps<T> &hideNodes(bool b=true) {_showNodes=!b;return *this;}
   585   
   586   ///Sets the size of the node texts
   587   GraphToEps<T> &nodeTextSize(double d) {_nodeTextSize=d;return *this;}
   588 
   589   ///Sets the color of the node texts to be different from the node color
   590 
   591   ///Sets the color of the node texts to be as different from the node color
   592   ///as it is possible.
   593   GraphToEps<T> &distantColorNodeTexts()
   594   {_nodeTextColorType=DIST_COL;return *this;}
   595   ///Sets the color of the node texts to be black or white and always visible.
   596 
   597   ///Sets the color of the node texts to be black or white according to
   598   ///which is more different from the node color.
   599   GraphToEps<T> &distantBWNodeTexts()
   600   {_nodeTextColorType=DIST_BW;return *this;}
   601 
   602   ///Gives a preamble block for node Postscript block.
   603   
   604   ///Gives a preamble block for node Postscript block.
   605   ///
   606   ///\sa nodePsTexts()
   607   GraphToEps<T> & nodePsTextsPreamble(const char *str) {
   608     _nodePsTextsPreamble=str ;return *this;
   609   }
   610   ///Sets whether the graph is undirected
   611 
   612   ///Sets whether the graph is undirected.
   613   ///
   614   ///This setting is the default for undirected graphs.
   615   ///
   616   ///\sa directed()
   617    GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;}
   618 
   619   ///Sets whether the graph is directed
   620 
   621   ///Sets whether the graph is directed.
   622   ///Use it to show the edges as a pair of directed ones.
   623   ///
   624   ///This setting is the default for digraphs.
   625   ///
   626   ///\sa undirected()
   627   GraphToEps<T> &directed(bool b=true) {_undirected=!b;return *this;}
   628   
   629   ///Sets the title.
   630 
   631   ///Sets the title of the generated image,
   632   ///namely it inserts a <tt>%%Title:</tt> DSC field to the header of
   633   ///the EPS file.
   634   GraphToEps<T> &title(const std::string &t) {_title=t;return *this;}
   635   ///Sets the copyright statement.
   636 
   637   ///Sets the copyright statement of the generated image,
   638   ///namely it inserts a <tt>%%Copyright:</tt> DSC field to the header of
   639   ///the EPS file.
   640   GraphToEps<T> &copyright(const std::string &t) {_copyright=t;return *this;}
   641 
   642 protected:
   643   bool isInsideNode(dim2::Point<double> p, double r,int t) 
   644   {
   645     switch(t) {
   646     case CIRCLE:
   647     case MALE:
   648     case FEMALE:
   649       return p.normSquare()<=r*r;
   650     case SQUARE:
   651       return p.x<=r&&p.x>=-r&&p.y<=r&&p.y>=-r;
   652     case DIAMOND:
   653       return p.x+p.y<=r && p.x-p.y<=r && -p.x+p.y<=r && -p.x-p.y<=r;
   654     }
   655     return false;
   656   }
   657 
   658 public:
   659   ~GraphToEps() { }
   660   
   661   ///Draws the graph.
   662 
   663   ///Like other functions using
   664   ///\ref named-templ-func-param "named template parameters",
   665   ///this function calls the algorithm itself, i.e. in this case
   666   ///it draws the graph.
   667   void run() {
   668     //\todo better 'epsilon' would be nice here.
   669     const double EPSILON=1e-9;
   670     if(dontPrint) return;
   671     
   672     _graph_to_eps_bits::_NegY<typename T::CoordsMapType>
   673       mycoords(_coords,_negY);
   674 
   675     os << "%!PS-Adobe-2.0 EPSF-2.0\n";
   676     if(_title.size()>0) os << "%%Title: " << _title << '\n';
   677      if(_copyright.size()>0) os << "%%Copyright: " << _copyright << '\n';
   678     os << "%%Creator: LEMON, graphToEps()\n";
   679 
   680     {    
   681 #ifndef WIN32 
   682       timeval tv;
   683       gettimeofday(&tv, 0);
   684 
   685       char cbuf[26];
   686       ctime_r(&tv.tv_sec,cbuf);
   687       os << "%%CreationDate: " << cbuf;
   688 #else
   689       SYSTEMTIME time;
   690       char buf1[11], buf2[9], buf3[5];
   691       
   692       GetSystemTime(&time);
   693       if (GetDateFormat(LOCALE_USER_DEFAULT, 0, &time, 
   694 			"ddd MMM dd", buf1, 11) &&
   695 	  GetTimeFormat(LOCALE_USER_DEFAULT, 0, &time, 
   696 			"HH':'mm':'ss", buf2, 9) &&
   697 	  GetDateFormat(LOCALE_USER_DEFAULT, 0, &time, 
   698 				"yyyy", buf3, 5)) {
   699 	os << "%%CreationDate: " << buf1 << ' ' 
   700 	   << buf2 << ' ' << buf3 << std::endl;
   701       }	  
   702 #endif
   703     }
   704 
   705     if (_autoArcWidthScale) {
   706       double max_w=0;
   707       for(ArcIt e(g);e!=INVALID;++e)
   708 	max_w=std::max(double(_arcWidths[e]),max_w);
   709       //\todo better 'epsilon' would be nice here.
   710       if(max_w>EPSILON) {
   711 	_arcWidthScale/=max_w;
   712       }
   713     }
   714 
   715     if (_autoNodeScale) {
   716       double max_s=0;
   717       for(NodeIt n(g);n!=INVALID;++n)
   718 	max_s=std::max(double(_nodeSizes[n]),max_s);
   719       //\todo better 'epsilon' would be nice here.
   720       if(max_s>EPSILON) {
   721 	_nodeScale/=max_s;
   722       }
   723     }
   724 
   725     double diag_len = 1;
   726     if(!(_absoluteNodeSizes&&_absoluteArcWidths)) {
   727       dim2::BoundingBox<double> bb;
   728       for(NodeIt n(g);n!=INVALID;++n) bb.add(mycoords[n]);
   729       if (bb.empty()) {
   730 	bb = dim2::BoundingBox<double>(dim2::Point<double>(0,0));
   731       }
   732       diag_len = std::sqrt((bb.bottomLeft()-bb.topRight()).normSquare());
   733       if(diag_len<EPSILON) diag_len = 1;
   734       if(!_absoluteNodeSizes) _nodeScale*=diag_len;
   735       if(!_absoluteArcWidths) _arcWidthScale*=diag_len;
   736     }
   737     
   738     dim2::BoundingBox<double> bb;
   739     for(NodeIt n(g);n!=INVALID;++n) {
   740       double ns=_nodeSizes[n]*_nodeScale;
   741       dim2::Point<double> p(ns,ns);
   742       switch(_nodeShapes[n]) {
   743       case CIRCLE:
   744       case SQUARE:
   745       case DIAMOND:
   746 	bb.add(p+mycoords[n]);
   747 	bb.add(-p+mycoords[n]);
   748 	break;
   749       case MALE:
   750 	bb.add(-p+mycoords[n]);
   751 	bb.add(dim2::Point<double>(1.5*ns,1.5*std::sqrt(3.0)*ns)+mycoords[n]);
   752 	break;
   753       case FEMALE:
   754 	bb.add(p+mycoords[n]);
   755 	bb.add(dim2::Point<double>(-ns,-3.01*ns)+mycoords[n]);
   756 	break;
   757       }
   758     }
   759     if (bb.empty()) {
   760       bb = dim2::BoundingBox<double>(dim2::Point<double>(0,0));
   761     }
   762     
   763     if(_scaleToA4)
   764       os <<"%%BoundingBox: 0 0 596 842\n%%DocumentPaperSizes: a4\n";
   765     else {
   766       if(_preScale) {
   767 	//Rescale so that BoundingBox won't be neither to big nor too small.
   768 	while(bb.height()*_scale>1000||bb.width()*_scale>1000) _scale/=10;
   769 	while(bb.height()*_scale<100||bb.width()*_scale<100) _scale*=10;
   770       }
   771       
   772       os << "%%BoundingBox: "
   773 	 << int(floor(bb.left()   * _scale - _xBorder)) << ' '
   774 	 << int(floor(bb.bottom() * _scale - _yBorder)) << ' '
   775 	 << int(ceil(bb.right()  * _scale + _xBorder)) << ' '
   776 	 << int(ceil(bb.top()    * _scale + _yBorder)) << '\n';
   777     }
   778     
   779     os << "%%EndComments\n";
   780     
   781     //x1 y1 x2 y2 x3 y3 cr cg cb w
   782     os << "/lb { setlinewidth setrgbcolor newpath moveto\n"
   783        << "      4 2 roll 1 index 1 index curveto stroke } bind def\n";
   784     os << "/l { setlinewidth setrgbcolor newpath moveto lineto stroke } bind def\n";
   785     //x y r
   786     os << "/c { newpath dup 3 index add 2 index moveto 0 360 arc closepath } bind def\n";
   787     //x y r
   788     os << "/sq { newpath 2 index 1 index add 2 index 2 index add moveto\n"
   789        << "      2 index 1 index sub 2 index 2 index add lineto\n"
   790        << "      2 index 1 index sub 2 index 2 index sub lineto\n"
   791        << "      2 index 1 index add 2 index 2 index sub lineto\n"
   792        << "      closepath pop pop pop} bind def\n";
   793     //x y r
   794     os << "/di { newpath 2 index 1 index add 2 index moveto\n"
   795        << "      2 index             2 index 2 index add lineto\n"
   796        << "      2 index 1 index sub 2 index             lineto\n"
   797        << "      2 index             2 index 2 index sub lineto\n"
   798        << "      closepath pop pop pop} bind def\n";
   799     // x y r cr cg cb
   800     os << "/nc { 0 0 0 setrgbcolor 5 index 5 index 5 index c fill\n"
   801        << "     setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
   802        << "   } bind def\n";
   803     os << "/nsq { 0 0 0 setrgbcolor 5 index 5 index 5 index sq fill\n"
   804        << "     setrgbcolor " << 1+_nodeBorderQuotient << " div sq fill\n"
   805        << "   } bind def\n";
   806     os << "/ndi { 0 0 0 setrgbcolor 5 index 5 index 5 index di fill\n"
   807        << "     setrgbcolor " << 1+_nodeBorderQuotient << " div di fill\n"
   808        << "   } bind def\n";
   809     os << "/nfemale { 0 0 0 setrgbcolor 3 index "
   810        << _nodeBorderQuotient/(1+_nodeBorderQuotient)
   811        << " 1.5 mul mul setlinewidth\n"
   812        << "  newpath 5 index 5 index moveto "
   813        << "5 index 5 index 5 index 3.01 mul sub\n"
   814        << "  lineto 5 index 4 index .7 mul sub 5 index 5 index 2.2 mul sub moveto\n"
   815        << "  5 index 4 index .7 mul add 5 index 5 index 2.2 mul sub lineto stroke\n"
   816        << "  5 index 5 index 5 index c fill\n"
   817        << "  setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
   818        << "  } bind def\n";
   819     os << "/nmale {\n"
   820        << "  0 0 0 setrgbcolor 3 index "
   821        << _nodeBorderQuotient/(1+_nodeBorderQuotient)
   822        <<" 1.5 mul mul setlinewidth\n"
   823        << "  newpath 5 index 5 index moveto\n"
   824        << "  5 index 4 index 1 mul 1.5 mul add\n"
   825        << "  5 index 5 index 3 sqrt 1.5 mul mul add\n"
   826        << "  1 index 1 index lineto\n"
   827        << "  1 index 1 index 7 index sub moveto\n"
   828        << "  1 index 1 index lineto\n"
   829        << "  exch 5 index 3 sqrt .5 mul mul sub exch 5 index .5 mul sub lineto\n"
   830        << "  stroke\n"
   831        << "  5 index 5 index 5 index c fill\n"
   832        << "  setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
   833        << "  } bind def\n";
   834     
   835 
   836     os << "/arrl " << _arrowLength << " def\n";
   837     os << "/arrw " << _arrowWidth << " def\n";
   838     // l dx_norm dy_norm
   839     os << "/lrl { 2 index mul exch 2 index mul exch rlineto pop} bind def\n";
   840     //len w dx_norm dy_norm x1 y1 cr cg cb
   841     os << "/arr { setrgbcolor /y1 exch def /x1 exch def /dy exch def /dx exch def\n"
   842        << "       /w exch def /len exch def\n"
   843       //	 << "       0.1 setlinewidth x1 y1 moveto dx len mul dy len mul rlineto stroke"
   844        << "       newpath x1 dy w 2 div mul add y1 dx w 2 div mul sub moveto\n"
   845        << "       len w sub arrl sub dx dy lrl\n"
   846        << "       arrw dy dx neg lrl\n"
   847        << "       dx arrl w add mul dy w 2 div arrw add mul sub\n"
   848        << "       dy arrl w add mul dx w 2 div arrw add mul add rlineto\n"
   849        << "       dx arrl w add mul neg dy w 2 div arrw add mul sub\n"
   850        << "       dy arrl w add mul neg dx w 2 div arrw add mul add rlineto\n"
   851        << "       arrw dy dx neg lrl\n"
   852        << "       len w sub arrl sub neg dx dy lrl\n"
   853        << "       closepath fill } bind def\n";
   854     os << "/cshow { 2 index 2 index moveto dup stringwidth pop\n"
   855        << "         neg 2 div fosi .35 mul neg rmoveto show pop pop} def\n";
   856 
   857     os << "\ngsave\n";
   858     if(_scaleToA4)
   859       if(bb.height()>bb.width()) {
   860 	double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(),
   861 		  (A4WIDTH-2*A4BORDER)/bb.width());
   862 	os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' '
   863 	   << ((A4HEIGHT-2*A4BORDER)-sc*bb.height())/2 + A4BORDER
   864 	   << " translate\n"
   865 	   << sc << " dup scale\n"
   866 	   << -bb.left() << ' ' << -bb.bottom() << " translate\n";
   867       }
   868       else {
   869 	//\todo Verify centering
   870 	double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
   871 		  (A4WIDTH-2*A4BORDER)/bb.height());
   872 	os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' '
   873 	   << ((A4HEIGHT-2*A4BORDER)-sc*bb.width())/2 + A4BORDER 
   874 	   << " translate\n"
   875 	   << sc << " dup scale\n90 rotate\n"
   876 	   << -bb.left() << ' ' << -bb.top() << " translate\n";	
   877 	}
   878     else if(_scale!=1.0) os << _scale << " dup scale\n";
   879     
   880     if(_showArcs) {
   881       os << "%Arcs:\ngsave\n";      
   882       if(_enableParallel) {
   883 	std::vector<Arc> el;
   884 	for(ArcIt e(g);e!=INVALID;++e)
   885 	  if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
   886 	     &&g.source(e)!=g.target(e))
   887 	    el.push_back(e);
   888 	std::sort(el.begin(),el.end(),arcLess(g));
   889 	
   890 	typename std::vector<Arc>::iterator j;
   891 	for(typename std::vector<Arc>::iterator i=el.begin();i!=el.end();i=j) {
   892 	  for(j=i+1;j!=el.end()&&isParallel(*i,*j);++j) ;
   893 
   894 	  double sw=0;
   895 	  for(typename std::vector<Arc>::iterator e=i;e!=j;++e)
   896 	    sw+=_arcWidths[*e]*_arcWidthScale+_parArcDist;
   897 	  sw-=_parArcDist;
   898 	  sw/=-2.0;
   899 	  dim2::Point<double>
   900 	    dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]);
   901 	  double l=std::sqrt(dvec.normSquare()); 
   902 	  //\todo better 'epsilon' would be nice here.
   903 	  dim2::Point<double> d(dvec/std::max(l,EPSILON));
   904  	  dim2::Point<double> m;
   905 // 	  m=dim2::Point<double>(mycoords[g.target(*i)]+mycoords[g.source(*i)])/2.0;
   906 
   907 //  	  m=dim2::Point<double>(mycoords[g.source(*i)])+
   908 // 	    dvec*(double(_nodeSizes[g.source(*i)])/
   909 // 	       (_nodeSizes[g.source(*i)]+_nodeSizes[g.target(*i)]));
   910 
   911  	  m=dim2::Point<double>(mycoords[g.source(*i)])+
   912 	    d*(l+_nodeSizes[g.source(*i)]-_nodeSizes[g.target(*i)])/2.0;
   913 
   914 	  for(typename std::vector<Arc>::iterator e=i;e!=j;++e) {
   915 	    sw+=_arcWidths[*e]*_arcWidthScale/2.0;
   916 	    dim2::Point<double> mm=m+rot90(d)*sw/.75;
   917 	    if(_drawArrows) {
   918 	      int node_shape;
   919 	      dim2::Point<double> s=mycoords[g.source(*e)];
   920 	      dim2::Point<double> t=mycoords[g.target(*e)];
   921 	      double rn=_nodeSizes[g.target(*e)]*_nodeScale;
   922 	      node_shape=_nodeShapes[g.target(*e)];
   923 	      dim2::Bezier3 bez(s,mm,mm,t);
   924 	      double t1=0,t2=1;
   925 	      for(int ii=0;ii<INTERPOL_PREC;++ii)
   926 		if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t2=(t1+t2)/2;
   927 		else t1=(t1+t2)/2;
   928 	      dim2::Point<double> apoint=bez((t1+t2)/2);
   929 	      rn = _arrowLength+_arcWidths[*e]*_arcWidthScale;
   930 	      rn*=rn;
   931 	      t2=(t1+t2)/2;t1=0;
   932 	      for(int ii=0;ii<INTERPOL_PREC;++ii)
   933 		if((bez((t1+t2)/2)-apoint).normSquare()>rn) t1=(t1+t2)/2;
   934 		else t2=(t1+t2)/2;
   935 	      dim2::Point<double> linend=bez((t1+t2)/2);	      
   936 	      bez=bez.before((t1+t2)/2);
   937 // 	      rn=_nodeSizes[g.source(*e)]*_nodeScale;
   938 // 	      node_shape=_nodeShapes[g.source(*e)];
   939 // 	      t1=0;t2=1;
   940 // 	      for(int i=0;i<INTERPOL_PREC;++i)
   941 // 		if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t1=(t1+t2)/2;
   942 // 		else t2=(t1+t2)/2;
   943 // 	      bez=bez.after((t1+t2)/2);
   944 	      os << _arcWidths[*e]*_arcWidthScale << " setlinewidth "
   945 		 << _arcColors[*e].red() << ' '
   946 		 << _arcColors[*e].green() << ' '
   947 		 << _arcColors[*e].blue() << " setrgbcolor newpath\n"
   948 		 << bez.p1.x << ' ' <<  bez.p1.y << " moveto\n"
   949 		 << bez.p2.x << ' ' << bez.p2.y << ' '
   950 		 << bez.p3.x << ' ' << bez.p3.y << ' '
   951 		 << bez.p4.x << ' ' << bez.p4.y << " curveto stroke\n";
   952 	      dim2::Point<double> dd(rot90(linend-apoint));
   953 	      dd*=(.5*_arcWidths[*e]*_arcWidthScale+_arrowWidth)/
   954 		std::sqrt(dd.normSquare());
   955 	      os << "newpath " << psOut(apoint) << " moveto "
   956 		 << psOut(linend+dd) << " lineto "
   957 		 << psOut(linend-dd) << " lineto closepath fill\n";
   958 	    }
   959 	    else {
   960 	      os << mycoords[g.source(*e)].x << ' '
   961 		 << mycoords[g.source(*e)].y << ' '
   962 		 << mm.x << ' ' << mm.y << ' '
   963 		 << mycoords[g.target(*e)].x << ' '
   964 		 << mycoords[g.target(*e)].y << ' '
   965 		 << _arcColors[*e].red() << ' '
   966 		 << _arcColors[*e].green() << ' '
   967 		 << _arcColors[*e].blue() << ' '
   968 		 << _arcWidths[*e]*_arcWidthScale << " lb\n";
   969 	    }
   970 	    sw+=_arcWidths[*e]*_arcWidthScale/2.0+_parArcDist;
   971 	  }
   972 	}
   973       }
   974       else for(ArcIt e(g);e!=INVALID;++e)
   975 	if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
   976 	   &&g.source(e)!=g.target(e)) {
   977 	  if(_drawArrows) {
   978 	    dim2::Point<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);
   979 	    double rn=_nodeSizes[g.target(e)]*_nodeScale;
   980 	    int node_shape=_nodeShapes[g.target(e)];
   981 	    double t1=0,t2=1;
   982 	    for(int i=0;i<INTERPOL_PREC;++i)
   983 	      if(isInsideNode((-(t1+t2)/2)*d,rn,node_shape)) t1=(t1+t2)/2;
   984 	      else t2=(t1+t2)/2;
   985 	    double l=std::sqrt(d.normSquare());
   986 	    d/=l;
   987 	    
   988 	    os << l*(1-(t1+t2)/2) << ' '
   989 	       << _arcWidths[e]*_arcWidthScale << ' '
   990 	       << d.x << ' ' << d.y << ' '
   991 	       << mycoords[g.source(e)].x << ' '
   992 	       << mycoords[g.source(e)].y << ' '
   993 	       << _arcColors[e].red() << ' '
   994 	       << _arcColors[e].green() << ' '
   995 	       << _arcColors[e].blue() << " arr\n";
   996 	  } 
   997 	  else os << mycoords[g.source(e)].x << ' '
   998 		  << mycoords[g.source(e)].y << ' '
   999 		  << mycoords[g.target(e)].x << ' '
  1000 		  << mycoords[g.target(e)].y << ' '
  1001 		  << _arcColors[e].red() << ' '
  1002 		  << _arcColors[e].green() << ' '
  1003 		  << _arcColors[e].blue() << ' '
  1004 		  << _arcWidths[e]*_arcWidthScale << " l\n";
  1005 	}
  1006       os << "grestore\n";
  1007     }
  1008     if(_showNodes) {
  1009       os << "%Nodes:\ngsave\n";
  1010       for(NodeIt n(g);n!=INVALID;++n) {
  1011 	os << mycoords[n].x << ' ' << mycoords[n].y << ' '
  1012 	   << _nodeSizes[n]*_nodeScale << ' '
  1013 	   << _nodeColors[n].red() << ' '
  1014 	   << _nodeColors[n].green() << ' '
  1015 	   << _nodeColors[n].blue() << ' ';
  1016 	switch(_nodeShapes[n]) {
  1017 	case CIRCLE:
  1018 	  os<< "nc";break;
  1019 	case SQUARE:
  1020 	  os<< "nsq";break;
  1021 	case DIAMOND:
  1022 	  os<< "ndi";break;
  1023 	case MALE:
  1024 	  os<< "nmale";break;
  1025 	case FEMALE:
  1026 	  os<< "nfemale";break;
  1027 	}
  1028 	os<<'\n';
  1029       }
  1030       os << "grestore\n";
  1031     }
  1032     if(_showNodeText) {
  1033       os << "%Node texts:\ngsave\n";
  1034       os << "/fosi " << _nodeTextSize << " def\n";
  1035       os << "(Helvetica) findfont fosi scalefont setfont\n";
  1036       for(NodeIt n(g);n!=INVALID;++n) {
  1037 	switch(_nodeTextColorType) {
  1038 	case DIST_COL:
  1039 	  os << psOut(distantColor(_nodeColors[n])) << " setrgbcolor\n";
  1040 	  break;
  1041 	case DIST_BW:
  1042 	  os << psOut(distantBW(_nodeColors[n])) << " setrgbcolor\n";
  1043 	  break;
  1044 	case CUST_COL:
  1045 	  os << psOut(distantColor(_nodeTextColors[n])) << " setrgbcolor\n";
  1046 	  break;
  1047 	default:
  1048 	  os << "0 0 0 setrgbcolor\n";
  1049 	}
  1050 	os << mycoords[n].x << ' ' << mycoords[n].y
  1051 	   << " (" << _nodeTexts[n] << ") cshow\n";
  1052       }
  1053       os << "grestore\n";
  1054     }
  1055     if(_showNodePsText) {
  1056       os << "%Node PS blocks:\ngsave\n";
  1057       for(NodeIt n(g);n!=INVALID;++n)
  1058 	os << mycoords[n].x << ' ' << mycoords[n].y
  1059 	   << " moveto\n" << _nodePsTexts[n] << "\n";
  1060       os << "grestore\n";
  1061     }
  1062     
  1063     os << "grestore\nshowpage\n";
  1064 
  1065     //CleanUp:
  1066     if(_pleaseRemoveOsStream) {delete &os;}
  1067   }
  1068 
  1069   ///\name Aliases
  1070   ///These are just some aliases to other parameter setting functions.
  1071 
  1072   ///@{
  1073 
  1074   ///An alias for arcWidths()
  1075   template<class X> GraphToEps<ArcWidthsTraits<X> > edgeWidths(const X &x)
  1076   {
  1077     return arcWidths(x);
  1078   }
  1079 
  1080   ///An alias for arcColors()
  1081   template<class X> GraphToEps<ArcColorsTraits<X> >
  1082   edgeColors(const X &x)
  1083   {
  1084     return arcColors(x);
  1085   }
  1086 
  1087   ///An alias for arcWidthScale()
  1088   GraphToEps<T> &edgeWidthScale(double d) {return arcWidthScale(d);}
  1089 
  1090   ///An alias for autoArcWidthScale()
  1091   GraphToEps<T> &autoEdgeWidthScale(bool b=true)
  1092   {
  1093     return autoArcWidthScale(b);
  1094   }
  1095   
  1096   ///An alias for absoluteArcWidths()
  1097   GraphToEps<T> &absoluteEdgeWidths(bool b=true)
  1098   {
  1099     return absoluteArcWidths(b);
  1100   }
  1101   
  1102   ///An alias for parArcDist()
  1103   GraphToEps<T> &parEdgeDist(double d) {return parArcDist(d);}
  1104   
  1105   ///An alias for hideArcs()
  1106   GraphToEps<T> &hideEdges(bool b=true) {return hideArcs(b);}
  1107 
  1108   ///@}
  1109 };
  1110 
  1111 template<class T>
  1112 const int GraphToEps<T>::INTERPOL_PREC = 20;
  1113 template<class T>
  1114 const double GraphToEps<T>::A4HEIGHT = 841.8897637795276;
  1115 template<class T>
  1116 const double GraphToEps<T>::A4WIDTH  = 595.275590551181;
  1117 template<class T>
  1118 const double GraphToEps<T>::A4BORDER = 15;
  1119 
  1120 
  1121 ///Generates an EPS file from a graph
  1122 
  1123 ///\ingroup eps_io
  1124 ///Generates an EPS file from a graph.
  1125 ///\param g Reference to the graph to be printed.
  1126 ///\param os Reference to the output stream.
  1127 ///By default it is <tt>std::cout</tt>.
  1128 ///
  1129 ///This function also has a lot of
  1130 ///\ref named-templ-func-param "named parameters",
  1131 ///they are declared as the members of class \ref GraphToEps. The following
  1132 ///example shows how to use these parameters.
  1133 ///\code
  1134 /// graphToEps(g,os).scale(10).coords(coords)
  1135 ///              .nodeScale(2).nodeSizes(sizes)
  1136 ///              .arcWidthScale(.4).run();
  1137 ///\endcode
  1138 ///
  1139 ///For more detailed examples see the \ref graph_to_eps_demo.cc demo file.
  1140 ///
  1141 ///\warning Don't forget to put the \ref GraphToEps::run() "run()"
  1142 ///to the end of the parameter list.
  1143 ///\sa GraphToEps
  1144 ///\sa graphToEps(G &g, const char *file_name)
  1145 template<class G>
  1146 GraphToEps<DefaultGraphToEpsTraits<G> > 
  1147 graphToEps(G &g, std::ostream& os=std::cout)
  1148 {
  1149   return 
  1150     GraphToEps<DefaultGraphToEpsTraits<G> >(DefaultGraphToEpsTraits<G>(g,os));
  1151 }
  1152  
  1153 ///Generates an EPS file from a graph
  1154 
  1155 ///\ingroup eps_io
  1156 ///This function does the same as
  1157 ///\ref graphToEps(G &g,std::ostream& os)
  1158 ///but it writes its output into the file \c file_name
  1159 ///instead of a stream.
  1160 ///\sa graphToEps(G &g, std::ostream& os)
  1161 template<class G>
  1162 GraphToEps<DefaultGraphToEpsTraits<G> > 
  1163 graphToEps(G &g,const char *file_name)
  1164 {
  1165   return GraphToEps<DefaultGraphToEpsTraits<G> >
  1166     (DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name),true));
  1167 }
  1168 
  1169 ///Generates an EPS file from a graph
  1170 
  1171 ///\ingroup eps_io
  1172 ///This function does the same as
  1173 ///\ref graphToEps(G &g,std::ostream& os)
  1174 ///but it writes its output into the file \c file_name
  1175 ///instead of a stream.
  1176 ///\sa graphToEps(G &g, std::ostream& os)
  1177 template<class G>
  1178 GraphToEps<DefaultGraphToEpsTraits<G> > 
  1179 graphToEps(G &g,const std::string& file_name)
  1180 {
  1181   return GraphToEps<DefaultGraphToEpsTraits<G> >
  1182     (DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name.c_str()),true));
  1183 }
  1184 
  1185 } //END OF NAMESPACE LEMON
  1186 
  1187 #endif // LEMON_GRAPH_TO_EPS_H