COIN-OR::LEMON - Graph Library

source: lemon-1.0/lemon/graph_to_eps.h @ 135:6e7aee618f03

Last change on this file since 135:6e7aee618f03 was 134:0775d2ba2afb, checked in by Balazs Dezso <deba@…>, 11 years ago

MinGW compatibility for graph_to_eps.h

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