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