COIN-OR::LEMON - Graph Library

source: lemon-1.0/lemon/graph_to_eps.h @ 143:c3b45bb643b0

Last change on this file since 143:c3b45bb643b0 was 143:c3b45bb643b0, checked in by Alpar Juttner <alpar@…>, 11 years ago

Resolve several MSVC related compilation problems

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