3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2008
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
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.
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
19 #ifndef LEMON_GRAPH_TO_EPS_H
20 #define LEMON_GRAPH_TO_EPS_H
25 #include <lemon/bits/mingw32_time.h>
36 #include<lemon/math.h>
37 #include<lemon/bits/invalid.h>
38 #include<lemon/dim2.h>
39 #include<lemon/maps.h>
40 #include<lemon/color.h>
41 #include<lemon/bits/bezier.h>
46 ///\brief A well configurable tool for visualizing graphs
50 namespace _graph_to_eps_bits {
54 typedef typename MT::Key Key;
55 typedef typename MT::Value Value;
58 _NegY(const MT &m,bool b) : map(m), yscale(1-b*2) {}
59 Value operator[](Key n) { return Value(map[n].x,map[n].y*yscale);}
63 ///Default traits class of \ref GraphToEps
65 ///Default traits class of \ref GraphToEps
67 ///\c G is the type of the underlying graph.
69 struct DefaultGraphToEpsTraits
72 typedef typename Graph::Node Node;
73 typedef typename Graph::NodeIt NodeIt;
74 typedef typename Graph::Arc Arc;
75 typedef typename Graph::ArcIt ArcIt;
76 typedef typename Graph::InArcIt InArcIt;
77 typedef typename Graph::OutArcIt OutArcIt;
84 typedef ConstMap<typename Graph::Node,dim2::Point<double> > CoordsMapType;
85 CoordsMapType _coords;
86 ConstMap<typename Graph::Node,double > _nodeSizes;
87 ConstMap<typename Graph::Node,int > _nodeShapes;
89 ConstMap<typename Graph::Node,Color > _nodeColors;
90 ConstMap<typename Graph::Arc,Color > _arcColors;
92 ConstMap<typename Graph::Arc,double > _arcWidths;
94 double _arcWidthScale;
97 double _xBorder, _yBorder;
99 double _nodeBorderQuotient;
102 double _arrowLength, _arrowWidth;
104 bool _showNodes, _showArcs;
106 bool _enableParallel;
110 ConstMap<typename Graph::Node,bool > _nodeTexts;
111 double _nodeTextSize;
113 bool _showNodePsText;
114 ConstMap<typename Graph::Node,bool > _nodePsTexts;
115 char *_nodePsTextsPreamble;
119 bool _pleaseRemoveOsStream;
124 std::string _copyright;
126 enum NodeTextColorType
127 { DIST_COL=0, DIST_BW=1, CUST_COL=2, SAME_COL=3 } _nodeTextColorType;
128 ConstMap<typename Graph::Node,Color > _nodeTextColors;
131 bool _autoArcWidthScale;
133 bool _absoluteNodeSizes;
134 bool _absoluteArcWidths;
142 ///\param _g is a reference to the graph to be printed
143 ///\param _os is a reference to the output stream.
144 ///\param _os is a reference to the output stream.
145 ///\param _pros If it is \c true, then the \c ostream referenced by \c _os
146 ///will be explicitly deallocated by the destructor.
147 ///By default it is <tt>std::cout</tt>
148 DefaultGraphToEpsTraits(const G &_g,std::ostream& _os=std::cout,
151 _coords(dim2::Point<double>(1,1)), _nodeSizes(1), _nodeShapes(0),
152 _nodeColors(WHITE), _arcColors(BLACK),
153 _arcWidths(1.0), _arcWidthScale(0.003),
154 _nodeScale(.01), _xBorder(10), _yBorder(10), _scale(1.0),
155 _nodeBorderQuotient(.1),
156 _drawArrows(false), _arrowLength(1), _arrowWidth(0.3),
157 _showNodes(true), _showArcs(true),
158 _enableParallel(false), _parArcDist(1),
159 _showNodeText(false), _nodeTexts(false), _nodeTextSize(1),
160 _showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0),
161 _undirected(lemon::UndirectedTagIndicator<G>::value),
162 _pleaseRemoveOsStream(_pros), _scaleToA4(false),
163 _nodeTextColorType(SAME_COL), _nodeTextColors(BLACK),
164 _autoNodeScale(false),
165 _autoArcWidthScale(false),
166 _absoluteNodeSizes(false),
167 _absoluteArcWidths(false),
173 ///Auxiliary class to implement the named parameters of \ref graphToEps()
175 ///Auxiliary class to implement the named parameters of \ref graphToEps()
176 template<class T> class GraphToEps : public T
178 // Can't believe it is required by the C++ standard
184 using T::_nodeShapes;
185 using T::_nodeColors;
189 using T::_arcWidthScale;
194 using T::_nodeBorderQuotient;
196 using T::_drawArrows;
197 using T::_arrowLength;
198 using T::_arrowWidth;
203 using T::_enableParallel;
204 using T::_parArcDist;
206 using T::_showNodeText;
208 using T::_nodeTextSize;
210 using T::_showNodePsText;
211 using T::_nodePsTexts;
212 using T::_nodePsTextsPreamble;
214 using T::_undirected;
216 using T::_pleaseRemoveOsStream;
223 using T::NodeTextColorType;
227 using T::_nodeTextColorType;
228 using T::_nodeTextColors;
230 using T::_autoNodeScale;
231 using T::_autoArcWidthScale;
233 using T::_absoluteNodeSizes;
234 using T::_absoluteArcWidths;
240 // dradnats ++C eht yb deriuqer si ti eveileb t'naC
242 typedef typename T::Graph Graph;
243 typedef typename Graph::Node Node;
244 typedef typename Graph::NodeIt NodeIt;
245 typedef typename Graph::Arc Arc;
246 typedef typename Graph::ArcIt ArcIt;
247 typedef typename Graph::InArcIt InArcIt;
248 typedef typename Graph::OutArcIt OutArcIt;
250 static const int INTERPOL_PREC;
251 static const double A4HEIGHT;
252 static const double A4WIDTH;
253 static const double A4BORDER;
264 ///\image html nodeshape_0.png
265 ///\image latex nodeshape_0.eps "CIRCLE shape (0)" width=2cm
268 ///\image html nodeshape_1.png
269 ///\image latex nodeshape_1.eps "SQUARE shape (1)" width=2cm
273 ///\image html nodeshape_2.png
274 ///\image latex nodeshape_2.eps "DIAMOND shape (2)" width=2cm
278 ///\image html nodeshape_3.png
279 ///\image latex nodeshape_2.eps "MALE shape (4)" width=2cm
283 ///\image html nodeshape_4.png
284 ///\image latex nodeshape_2.eps "FEMALE shape (4)" width=2cm
293 arcLess(const Graph &_g) : g(_g) {}
294 bool operator()(Arc a,Arc b) const
296 Node ai=std::min(g.source(a),g.target(a));
297 Node aa=std::max(g.source(a),g.target(a));
298 Node bi=std::min(g.source(b),g.target(b));
299 Node ba=std::max(g.source(b),g.target(b));
301 (ai==bi && (aa < ba ||
302 (aa==ba && ai==g.source(a) && bi==g.target(b))));
305 bool isParallel(Arc e,Arc f) const
307 return (g.source(e)==g.source(f)&&
308 g.target(e)==g.target(f)) ||
309 (g.source(e)==g.target(f)&&
310 g.target(e)==g.source(f));
313 static std::string psOut(const dim2::Point<TT> &p)
315 std::ostringstream os;
316 os << p.x << ' ' << p.y;
319 static std::string psOut(const Color &c)
321 std::ostringstream os;
322 os << c.red() << ' ' << c.green() << ' ' << c.blue();
327 GraphToEps(const T &t) : T(t), dontPrint(false) {};
329 template<class X> struct CoordsTraits : public T {
330 typedef X CoordsMapType;
332 CoordsTraits(const T &t,const X &x) : T(t), _coords(x) {}
334 ///Sets the map of the node coordinates
336 ///Sets the map of the node coordinates.
337 ///\param x must be a node map with dim2::Point<double> or
338 ///\ref dim2::Point "dim2::Point<int>" values.
339 template<class X> GraphToEps<CoordsTraits<X> > coords(const X &x) {
341 return GraphToEps<CoordsTraits<X> >(CoordsTraits<X>(*this,x));
343 template<class X> struct NodeSizesTraits : public T {
345 NodeSizesTraits(const T &t,const X &x) : T(t), _nodeSizes(x) {}
347 ///Sets the map of the node sizes
349 ///Sets the map of the node sizes
350 ///\param x must be a node map with \c double (or convertible) values.
351 template<class X> GraphToEps<NodeSizesTraits<X> > nodeSizes(const X &x)
354 return GraphToEps<NodeSizesTraits<X> >(NodeSizesTraits<X>(*this,x));
356 template<class X> struct NodeShapesTraits : public T {
357 const X &_nodeShapes;
358 NodeShapesTraits(const T &t,const X &x) : T(t), _nodeShapes(x) {}
360 ///Sets the map of the node shapes
362 ///Sets the map of the node shapes.
363 ///The available shape values
364 ///can be found in \ref NodeShapes "enum NodeShapes".
365 ///\param x must be a node map with \c int (or convertible) values.
367 template<class X> GraphToEps<NodeShapesTraits<X> > nodeShapes(const X &x)
370 return GraphToEps<NodeShapesTraits<X> >(NodeShapesTraits<X>(*this,x));
372 template<class X> struct NodeTextsTraits : public T {
374 NodeTextsTraits(const T &t,const X &x) : T(t), _nodeTexts(x) {}
376 ///Sets the text printed on the nodes
378 ///Sets the text printed on the nodes
379 ///\param x must be a node map with type that can be pushed to a standard
381 template<class X> GraphToEps<NodeTextsTraits<X> > nodeTexts(const X &x)
385 return GraphToEps<NodeTextsTraits<X> >(NodeTextsTraits<X>(*this,x));
387 template<class X> struct NodePsTextsTraits : public T {
388 const X &_nodePsTexts;
389 NodePsTextsTraits(const T &t,const X &x) : T(t), _nodePsTexts(x) {}
391 ///Inserts a PostScript block to the nodes
393 ///With this command it is possible to insert a verbatim PostScript
394 ///block to the nodes.
395 ///The PS current point will be moved to the centre of the node before
396 ///the PostScript block inserted.
398 ///Before and after the block a newline character is inserted so you
399 ///don't have to bother with the separators.
401 ///\param x must be a node map with type that can be pushed to a standard
404 ///\sa nodePsTextsPreamble()
405 template<class X> GraphToEps<NodePsTextsTraits<X> > nodePsTexts(const X &x)
408 _showNodePsText=true;
409 return GraphToEps<NodePsTextsTraits<X> >(NodePsTextsTraits<X>(*this,x));
411 template<class X> struct ArcWidthsTraits : public T {
413 ArcWidthsTraits(const T &t,const X &x) : T(t), _arcWidths(x) {}
415 ///Sets the map of the arc widths
417 ///Sets the map of the arc widths
418 ///\param x must be a arc map with \c double (or convertible) values.
419 template<class X> GraphToEps<ArcWidthsTraits<X> > arcWidths(const X &x)
422 return GraphToEps<ArcWidthsTraits<X> >(ArcWidthsTraits<X>(*this,x));
425 template<class X> struct NodeColorsTraits : public T {
426 const X &_nodeColors;
427 NodeColorsTraits(const T &t,const X &x) : T(t), _nodeColors(x) {}
429 ///Sets the map of the node colors
431 ///Sets the map of the node colors
432 ///\param x must be a node map with \ref Color values.
435 template<class X> GraphToEps<NodeColorsTraits<X> >
436 nodeColors(const X &x)
439 return GraphToEps<NodeColorsTraits<X> >(NodeColorsTraits<X>(*this,x));
441 template<class X> struct NodeTextColorsTraits : public T {
442 const X &_nodeTextColors;
443 NodeTextColorsTraits(const T &t,const X &x) : T(t), _nodeTextColors(x) {}
445 ///Sets the map of the node text colors
447 ///Sets the map of the node text colors
448 ///\param x must be a node map with \ref Color values.
451 template<class X> GraphToEps<NodeTextColorsTraits<X> >
452 nodeTextColors(const X &x)
455 _nodeTextColorType=CUST_COL;
456 return GraphToEps<NodeTextColorsTraits<X> >
457 (NodeTextColorsTraits<X>(*this,x));
459 template<class X> struct ArcColorsTraits : public T {
461 ArcColorsTraits(const T &t,const X &x) : T(t), _arcColors(x) {}
463 ///Sets the map of the arc colors
465 ///Sets the map of the arc colors
466 ///\param x must be a arc map with \ref Color values.
469 template<class X> GraphToEps<ArcColorsTraits<X> >
470 arcColors(const X &x)
473 return GraphToEps<ArcColorsTraits<X> >(ArcColorsTraits<X>(*this,x));
475 ///Sets a global scale factor for node sizes
477 ///Sets a global scale factor for node sizes.
479 /// If nodeSizes() is not given, this function simply sets the node
480 /// sizes to \c d. If nodeSizes() is given, but
481 /// autoNodeScale() is not, then the node size given by
482 /// nodeSizes() will be multiplied by the value \c d.
483 /// If both nodeSizes() and autoNodeScale() are used, then the
484 /// node sizes will be scaled in such a way that the greatest size will be
487 /// \sa autoNodeScale()
488 GraphToEps<T> &nodeScale(double d=.01) {_nodeScale=d;return *this;}
489 ///Turns on/off the automatic node width scaling.
491 ///Turns on/off the automatic node width scaling.
495 GraphToEps<T> &autoNodeScale(bool b=true) {
496 _autoNodeScale=b;return *this;
499 ///Turns on/off the absolutematic node width scaling.
501 ///Turns on/off the absolutematic node width scaling.
505 GraphToEps<T> &absoluteNodeSizes(bool b=true) {
506 _absoluteNodeSizes=b;return *this;
509 ///Negates the Y coordinates.
511 ///Negates the Y coordinates.
513 GraphToEps<T> &negateY(bool b=true) {
514 _negY=b;return *this;
517 ///Turn on/off pre-scaling
519 ///By default graphToEps() rescales the whole image in order to avoid
520 ///very big or very small bounding boxes.
522 ///This (p)rescaling can be turned off with this function.
524 GraphToEps<T> &preScale(bool b=true) {
525 _preScale=b;return *this;
528 ///Sets a global scale factor for arc widths
530 /// Sets a global scale factor for arc widths.
532 /// If arcWidths() is not given, this function simply sets the arc
533 /// widths to \c d. If arcWidths() is given, but
534 /// autoArcWidthScale() is not, then the arc withs given by
535 /// arcWidths() will be multiplied by the value \c d.
536 /// If both arcWidths() and autoArcWidthScale() are used, then the
537 /// arc withs will be scaled in such a way that the greatest width will be
539 GraphToEps<T> &arcWidthScale(double d=.003) {_arcWidthScale=d;return *this;}
540 ///Turns on/off the automatic arc width scaling.
542 ///Turns on/off the automatic arc width scaling.
544 ///\sa arcWidthScale()
546 GraphToEps<T> &autoArcWidthScale(bool b=true) {
547 _autoArcWidthScale=b;return *this;
549 ///Turns on/off the absolutematic arc width scaling.
551 ///Turns on/off the absolutematic arc width scaling.
553 ///\sa arcWidthScale()
555 GraphToEps<T> &absoluteArcWidths(bool b=true) {
556 _absoluteArcWidths=b;return *this;
558 ///Sets a global scale factor for the whole picture
560 ///Sets a global scale factor for the whole picture
563 GraphToEps<T> &scale(double d) {_scale=d;return *this;}
564 ///Sets the width of the border around the picture
566 ///Sets the width of the border around the picture
568 GraphToEps<T> &border(double b=10) {_xBorder=_yBorder=b;return *this;}
569 ///Sets the width of the border around the picture
571 ///Sets the width of the border around the picture
573 GraphToEps<T> &border(double x, double y) {
574 _xBorder=x;_yBorder=y;return *this;
576 ///Sets whether to draw arrows
578 ///Sets whether to draw arrows
580 GraphToEps<T> &drawArrows(bool b=true) {_drawArrows=b;return *this;}
581 ///Sets the length of the arrowheads
583 ///Sets the length of the arrowheads
585 GraphToEps<T> &arrowLength(double d=1.0) {_arrowLength*=d;return *this;}
586 ///Sets the width of the arrowheads
588 ///Sets the width of the arrowheads
590 GraphToEps<T> &arrowWidth(double d=.3) {_arrowWidth*=d;return *this;}
592 ///Scales the drawing to fit to A4 page
594 ///Scales the drawing to fit to A4 page
596 GraphToEps<T> &scaleToA4() {_scaleToA4=true;return *this;}
598 ///Enables parallel arcs
600 ///Enables parallel arcs
601 GraphToEps<T> &enableParallel(bool b=true) {_enableParallel=b;return *this;}
607 GraphToEps<T> &parArcDist(double d) {_parArcDist*=d;return *this;}
613 GraphToEps<T> &hideArcs(bool b=true) {_showArcs=!b;return *this;}
618 GraphToEps<T> &hideNodes(bool b=true) {_showNodes=!b;return *this;}
620 ///Sets the size of the node texts
622 ///Sets the size of the node texts
624 GraphToEps<T> &nodeTextSize(double d) {_nodeTextSize=d;return *this;}
626 ///Sets the color of the node texts to be different from the node color
628 ///Sets the color of the node texts to be as different from the node color
631 GraphToEps<T> &distantColorNodeTexts()
632 {_nodeTextColorType=DIST_COL;return *this;}
633 ///Sets the color of the node texts to be black or white and always visible.
635 ///Sets the color of the node texts to be black or white according to
637 ///different from the node color
639 GraphToEps<T> &distantBWNodeTexts()
640 {_nodeTextColorType=DIST_BW;return *this;}
642 ///Gives a preamble block for node Postscript block.
644 ///Gives a preamble block for node Postscript block.
647 GraphToEps<T> & nodePsTextsPreamble(const char *str) {
648 _nodePsTextsPreamble=str ;return *this;
650 ///Sets whether the the graph is undirected
652 ///Sets whether the the graph is undirected.
654 ///This setting is the default for undirected graphs.
657 GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;}
659 ///Sets whether the the graph is directed
661 ///Sets whether the the graph is directed.
662 ///Use it to show the edges as a pair of directed ones.
664 ///This setting is the default for digraphs.
667 GraphToEps<T> &directed(bool b=true) {_undirected=!b;return *this;}
671 ///Sets the title of the generated image,
672 ///namely it inserts a <tt>%%Title:</tt> DSC field to the header of
674 GraphToEps<T> &title(const std::string &t) {_title=t;return *this;}
675 ///Sets the copyright statement.
677 ///Sets the copyright statement of the generated image,
678 ///namely it inserts a <tt>%%Copyright:</tt> DSC field to the header of
680 GraphToEps<T> ©right(const std::string &t) {_copyright=t;return *this;}
683 bool isInsideNode(dim2::Point<double> p, double r,int t)
689 return p.normSquare()<=r*r;
691 return p.x<=r&&p.x>=-r&&p.y<=r&&p.y>=-r;
693 return p.x+p.y<=r && p.x-p.y<=r && -p.x+p.y<=r && -p.x-p.y<=r;
703 ///Like other functions using
704 ///\ref named-templ-func-param "named template parameters",
705 ///this function calls the algorithm itself, i.e. in this case
706 ///it draws the graph.
708 //\todo better 'epsilon' would be nice here.
709 const double EPSILON=1e-9;
710 if(dontPrint) return;
712 _graph_to_eps_bits::_NegY<typename T::CoordsMapType>
713 mycoords(_coords,_negY);
715 os << "%!PS-Adobe-2.0 EPSF-2.0\n";
716 if(_title.size()>0) os << "%%Title: " << _title << '\n';
717 if(_copyright.size()>0) os << "%%Copyright: " << _copyright << '\n';
718 // << "%%Copyright: XXXX\n"
719 os << "%%Creator: LEMON, graphToEps()\n";
724 gettimeofday(&tv, 0);
725 ctime_r(&tv.tv_sec,cbuf);
726 os << "%%CreationDate: " << cbuf;
729 if (_autoArcWidthScale) {
731 for(ArcIt e(g);e!=INVALID;++e)
732 max_w=std::max(double(_arcWidths[e]),max_w);
733 ///\todo better 'epsilon' would be nice here.
735 _arcWidthScale/=max_w;
739 if (_autoNodeScale) {
741 for(NodeIt n(g);n!=INVALID;++n)
742 max_s=std::max(double(_nodeSizes[n]),max_s);
743 ///\todo better 'epsilon' would be nice here.
750 if(!(_absoluteNodeSizes&&_absoluteArcWidths)) {
751 dim2::BoundingBox<double> bb;
752 for(NodeIt n(g);n!=INVALID;++n) bb.add(mycoords[n]);
754 bb = dim2::BoundingBox<double>(dim2::Point<double>(0,0));
756 diag_len = std::sqrt((bb.bottomLeft()-bb.topRight()).normSquare());
757 if(diag_len<EPSILON) diag_len = 1;
758 if(!_absoluteNodeSizes) _nodeScale*=diag_len;
759 if(!_absoluteArcWidths) _arcWidthScale*=diag_len;
762 dim2::BoundingBox<double> bb;
763 for(NodeIt n(g);n!=INVALID;++n) {
764 double ns=_nodeSizes[n]*_nodeScale;
765 dim2::Point<double> p(ns,ns);
766 switch(_nodeShapes[n]) {
770 bb.add(p+mycoords[n]);
771 bb.add(-p+mycoords[n]);
774 bb.add(-p+mycoords[n]);
775 bb.add(dim2::Point<double>(1.5*ns,1.5*std::sqrt(3.0)*ns)+mycoords[n]);
778 bb.add(p+mycoords[n]);
779 bb.add(dim2::Point<double>(-ns,-3.01*ns)+mycoords[n]);
784 bb = dim2::BoundingBox<double>(dim2::Point<double>(0,0));
788 os <<"%%BoundingBox: 0 0 596 842\n%%DocumentPaperSizes: a4\n";
791 //Rescale so that BoundingBox won't be neither to big nor too small.
792 while(bb.height()*_scale>1000||bb.width()*_scale>1000) _scale/=10;
793 while(bb.height()*_scale<100||bb.width()*_scale<100) _scale*=10;
796 os << "%%BoundingBox: "
797 << int(floor(bb.left() * _scale - _xBorder)) << ' '
798 << int(floor(bb.bottom() * _scale - _yBorder)) << ' '
799 << int(ceil(bb.right() * _scale + _xBorder)) << ' '
800 << int(ceil(bb.top() * _scale + _yBorder)) << '\n';
803 os << "%%EndComments\n";
805 //x1 y1 x2 y2 x3 y3 cr cg cb w
806 os << "/lb { setlinewidth setrgbcolor newpath moveto\n"
807 << " 4 2 roll 1 index 1 index curveto stroke } bind def\n";
808 os << "/l { setlinewidth setrgbcolor newpath moveto lineto stroke } bind def\n";
810 os << "/c { newpath dup 3 index add 2 index moveto 0 360 arc closepath } bind def\n";
812 os << "/sq { newpath 2 index 1 index add 2 index 2 index add moveto\n"
813 << " 2 index 1 index sub 2 index 2 index add lineto\n"
814 << " 2 index 1 index sub 2 index 2 index sub lineto\n"
815 << " 2 index 1 index add 2 index 2 index sub lineto\n"
816 << " closepath pop pop pop} bind def\n";
818 os << "/di { newpath 2 index 1 index add 2 index moveto\n"
819 << " 2 index 2 index 2 index add lineto\n"
820 << " 2 index 1 index sub 2 index lineto\n"
821 << " 2 index 2 index 2 index sub lineto\n"
822 << " closepath pop pop pop} bind def\n";
824 os << "/nc { 0 0 0 setrgbcolor 5 index 5 index 5 index c fill\n"
825 << " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
827 os << "/nsq { 0 0 0 setrgbcolor 5 index 5 index 5 index sq fill\n"
828 << " setrgbcolor " << 1+_nodeBorderQuotient << " div sq fill\n"
830 os << "/ndi { 0 0 0 setrgbcolor 5 index 5 index 5 index di fill\n"
831 << " setrgbcolor " << 1+_nodeBorderQuotient << " div di fill\n"
833 os << "/nfemale { 0 0 0 setrgbcolor 3 index "
834 << _nodeBorderQuotient/(1+_nodeBorderQuotient)
835 << " 1.5 mul mul setlinewidth\n"
836 << " newpath 5 index 5 index moveto "
837 << "5 index 5 index 5 index 3.01 mul sub\n"
838 << " lineto 5 index 4 index .7 mul sub 5 index 5 index 2.2 mul sub moveto\n"
839 << " 5 index 4 index .7 mul add 5 index 5 index 2.2 mul sub lineto stroke\n"
840 << " 5 index 5 index 5 index c fill\n"
841 << " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
844 << " 0 0 0 setrgbcolor 3 index "
845 << _nodeBorderQuotient/(1+_nodeBorderQuotient)
846 <<" 1.5 mul mul setlinewidth\n"
847 << " newpath 5 index 5 index moveto\n"
848 << " 5 index 4 index 1 mul 1.5 mul add\n"
849 << " 5 index 5 index 3 sqrt 1.5 mul mul add\n"
850 << " 1 index 1 index lineto\n"
851 << " 1 index 1 index 7 index sub moveto\n"
852 << " 1 index 1 index lineto\n"
853 << " exch 5 index 3 sqrt .5 mul mul sub exch 5 index .5 mul sub lineto\n"
855 << " 5 index 5 index 5 index c fill\n"
856 << " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
860 os << "/arrl " << _arrowLength << " def\n";
861 os << "/arrw " << _arrowWidth << " def\n";
863 os << "/lrl { 2 index mul exch 2 index mul exch rlineto pop} bind def\n";
864 //len w dx_norm dy_norm x1 y1 cr cg cb
865 os << "/arr { setrgbcolor /y1 exch def /x1 exch def /dy exch def /dx exch def\n"
866 << " /w exch def /len exch def\n"
867 // << " 0.1 setlinewidth x1 y1 moveto dx len mul dy len mul rlineto stroke"
868 << " newpath x1 dy w 2 div mul add y1 dx w 2 div mul sub moveto\n"
869 << " len w sub arrl sub dx dy lrl\n"
870 << " arrw dy dx neg lrl\n"
871 << " dx arrl w add mul dy w 2 div arrw add mul sub\n"
872 << " dy arrl w add mul dx w 2 div arrw add mul add rlineto\n"
873 << " dx arrl w add mul neg dy w 2 div arrw add mul sub\n"
874 << " dy arrl w add mul neg dx w 2 div arrw add mul add rlineto\n"
875 << " arrw dy dx neg lrl\n"
876 << " len w sub arrl sub neg dx dy lrl\n"
877 << " closepath fill } bind def\n";
878 os << "/cshow { 2 index 2 index moveto dup stringwidth pop\n"
879 << " neg 2 div fosi .35 mul neg rmoveto show pop pop} def\n";
883 if(bb.height()>bb.width()) {
884 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(),
885 (A4WIDTH-2*A4BORDER)/bb.width());
886 os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' '
887 << ((A4HEIGHT-2*A4BORDER)-sc*bb.height())/2 + A4BORDER
889 << sc << " dup scale\n"
890 << -bb.left() << ' ' << -bb.bottom() << " translate\n";
893 //\todo Verify centering
894 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
895 (A4WIDTH-2*A4BORDER)/bb.height());
896 os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' '
897 << ((A4HEIGHT-2*A4BORDER)-sc*bb.width())/2 + A4BORDER
899 << sc << " dup scale\n90 rotate\n"
900 << -bb.left() << ' ' << -bb.top() << " translate\n";
902 else if(_scale!=1.0) os << _scale << " dup scale\n";
905 os << "%Arcs:\ngsave\n";
906 if(_enableParallel) {
908 for(ArcIt e(g);e!=INVALID;++e)
909 if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
910 &&g.source(e)!=g.target(e))
912 std::sort(el.begin(),el.end(),arcLess(g));
914 typename std::vector<Arc>::iterator j;
915 for(typename std::vector<Arc>::iterator i=el.begin();i!=el.end();i=j) {
916 for(j=i+1;j!=el.end()&&isParallel(*i,*j);++j) ;
919 for(typename std::vector<Arc>::iterator e=i;e!=j;++e)
920 sw+=_arcWidths[*e]*_arcWidthScale+_parArcDist;
924 dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]);
925 double l=std::sqrt(dvec.normSquare());
926 //\todo better 'epsilon' would be nice here.
927 dim2::Point<double> d(dvec/std::max(l,EPSILON));
928 dim2::Point<double> m;
929 // m=dim2::Point<double>(mycoords[g.target(*i)]+mycoords[g.source(*i)])/2.0;
931 // m=dim2::Point<double>(mycoords[g.source(*i)])+
932 // dvec*(double(_nodeSizes[g.source(*i)])/
933 // (_nodeSizes[g.source(*i)]+_nodeSizes[g.target(*i)]));
935 m=dim2::Point<double>(mycoords[g.source(*i)])+
936 d*(l+_nodeSizes[g.source(*i)]-_nodeSizes[g.target(*i)])/2.0;
938 for(typename std::vector<Arc>::iterator e=i;e!=j;++e) {
939 sw+=_arcWidths[*e]*_arcWidthScale/2.0;
940 dim2::Point<double> mm=m+rot90(d)*sw/.75;
943 dim2::Point<double> s=mycoords[g.source(*e)];
944 dim2::Point<double> t=mycoords[g.target(*e)];
945 double rn=_nodeSizes[g.target(*e)]*_nodeScale;
946 node_shape=_nodeShapes[g.target(*e)];
947 dim2::Bezier3 bez(s,mm,mm,t);
949 for(int ii=0;ii<INTERPOL_PREC;++ii)
950 if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t2=(t1+t2)/2;
952 dim2::Point<double> apoint=bez((t1+t2)/2);
953 rn = _arrowLength+_arcWidths[*e]*_arcWidthScale;
956 for(int ii=0;ii<INTERPOL_PREC;++ii)
957 if((bez((t1+t2)/2)-apoint).normSquare()>rn) t1=(t1+t2)/2;
959 dim2::Point<double> linend=bez((t1+t2)/2);
960 bez=bez.before((t1+t2)/2);
961 // rn=_nodeSizes[g.source(*e)]*_nodeScale;
962 // node_shape=_nodeShapes[g.source(*e)];
964 // for(int i=0;i<INTERPOL_PREC;++i)
965 // if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t1=(t1+t2)/2;
966 // else t2=(t1+t2)/2;
967 // bez=bez.after((t1+t2)/2);
968 os << _arcWidths[*e]*_arcWidthScale << " setlinewidth "
969 << _arcColors[*e].red() << ' '
970 << _arcColors[*e].green() << ' '
971 << _arcColors[*e].blue() << " setrgbcolor newpath\n"
972 << bez.p1.x << ' ' << bez.p1.y << " moveto\n"
973 << bez.p2.x << ' ' << bez.p2.y << ' '
974 << bez.p3.x << ' ' << bez.p3.y << ' '
975 << bez.p4.x << ' ' << bez.p4.y << " curveto stroke\n";
976 dim2::Point<double> dd(rot90(linend-apoint));
977 dd*=(.5*_arcWidths[*e]*_arcWidthScale+_arrowWidth)/
978 std::sqrt(dd.normSquare());
979 os << "newpath " << psOut(apoint) << " moveto "
980 << psOut(linend+dd) << " lineto "
981 << psOut(linend-dd) << " lineto closepath fill\n";
984 os << mycoords[g.source(*e)].x << ' '
985 << mycoords[g.source(*e)].y << ' '
986 << mm.x << ' ' << mm.y << ' '
987 << mycoords[g.target(*e)].x << ' '
988 << mycoords[g.target(*e)].y << ' '
989 << _arcColors[*e].red() << ' '
990 << _arcColors[*e].green() << ' '
991 << _arcColors[*e].blue() << ' '
992 << _arcWidths[*e]*_arcWidthScale << " lb\n";
994 sw+=_arcWidths[*e]*_arcWidthScale/2.0+_parArcDist;
998 else for(ArcIt e(g);e!=INVALID;++e)
999 if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
1000 &&g.source(e)!=g.target(e))
1002 dim2::Point<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);
1003 double rn=_nodeSizes[g.target(e)]*_nodeScale;
1004 int node_shape=_nodeShapes[g.target(e)];
1006 for(int i=0;i<INTERPOL_PREC;++i)
1007 if(isInsideNode((-(t1+t2)/2)*d,rn,node_shape)) t1=(t1+t2)/2;
1009 double l=std::sqrt(d.normSquare());
1012 os << l*(1-(t1+t2)/2) << ' '
1013 << _arcWidths[e]*_arcWidthScale << ' '
1014 << d.x << ' ' << d.y << ' '
1015 << mycoords[g.source(e)].x << ' '
1016 << mycoords[g.source(e)].y << ' '
1017 << _arcColors[e].red() << ' '
1018 << _arcColors[e].green() << ' '
1019 << _arcColors[e].blue() << " arr\n";
1021 else os << mycoords[g.source(e)].x << ' '
1022 << mycoords[g.source(e)].y << ' '
1023 << mycoords[g.target(e)].x << ' '
1024 << mycoords[g.target(e)].y << ' '
1025 << _arcColors[e].red() << ' '
1026 << _arcColors[e].green() << ' '
1027 << _arcColors[e].blue() << ' '
1028 << _arcWidths[e]*_arcWidthScale << " l\n";
1032 os << "%Nodes:\ngsave\n";
1033 for(NodeIt n(g);n!=INVALID;++n) {
1034 os << mycoords[n].x << ' ' << mycoords[n].y << ' '
1035 << _nodeSizes[n]*_nodeScale << ' '
1036 << _nodeColors[n].red() << ' '
1037 << _nodeColors[n].green() << ' '
1038 << _nodeColors[n].blue() << ' ';
1039 switch(_nodeShapes[n]) {
1049 os<< "nfemale";break;
1056 os << "%Node texts:\ngsave\n";
1057 os << "/fosi " << _nodeTextSize << " def\n";
1058 os << "(Helvetica) findfont fosi scalefont setfont\n";
1059 for(NodeIt n(g);n!=INVALID;++n) {
1060 switch(_nodeTextColorType) {
1062 os << psOut(distantColor(_nodeColors[n])) << " setrgbcolor\n";
1065 os << psOut(distantBW(_nodeColors[n])) << " setrgbcolor\n";
1068 os << psOut(distantColor(_nodeTextColors[n])) << " setrgbcolor\n";
1071 os << "0 0 0 setrgbcolor\n";
1073 os << mycoords[n].x << ' ' << mycoords[n].y
1074 << " (" << _nodeTexts[n] << ") cshow\n";
1078 if(_showNodePsText) {
1079 os << "%Node PS blocks:\ngsave\n";
1080 for(NodeIt n(g);n!=INVALID;++n)
1081 os << mycoords[n].x << ' ' << mycoords[n].y
1082 << " moveto\n" << _nodePsTexts[n] << "\n";
1086 os << "grestore\nshowpage\n";
1089 if(_pleaseRemoveOsStream) {delete &os;}
1093 ///These are just some aliases to other parameter setting functions.
1097 ///An alias for arcWidths()
1099 ///An alias for arcWidths()
1101 template<class X> GraphToEps<ArcWidthsTraits<X> > edgeWidths(const X &x)
1103 return arcWidths(x);
1106 ///An alias for arcColors()
1108 ///An alias for arcColors()
1110 template<class X> GraphToEps<ArcColorsTraits<X> >
1111 edgeColors(const X &x)
1113 return arcColors(x);
1116 ///An alias for arcWidthScale()
1118 ///An alias for arcWidthScale()
1120 GraphToEps<T> &edgeWidthScale(double d) {return arcWidthScale(d);}
1122 ///An alias for autoArcWidthScale()
1124 ///An alias for autoArcWidthScale()
1126 GraphToEps<T> &autoEdgeWidthScale(bool b=true)
1128 return autoArcWidthScale(b);
1131 ///An alias for absoluteArcWidths()
1133 ///An alias for absoluteArcWidths()
1135 GraphToEps<T> &absoluteEdgeWidths(bool b=true)
1137 return absoluteArcWidths(b);
1140 ///An alias for parArcDist()
1142 ///An alias for parArcDist()
1144 GraphToEps<T> &parEdgeDist(double d) {return parArcDist(d);}
1146 ///An alias for hideArcs()
1148 ///An alias for hideArcs()
1150 GraphToEps<T> &hideEdges(bool b=true) {return hideArcs(b);}
1156 const int GraphToEps<T>::INTERPOL_PREC = 20;
1158 const double GraphToEps<T>::A4HEIGHT = 841.8897637795276;
1160 const double GraphToEps<T>::A4WIDTH = 595.275590551181;
1162 const double GraphToEps<T>::A4BORDER = 15;
1165 ///Generates an EPS file from a graph
1168 ///Generates an EPS file from a graph.
1169 ///\param g is a reference to the graph to be printed
1170 ///\param os is a reference to the output stream.
1171 ///By default it is <tt>std::cout</tt>
1173 ///This function also has a lot of
1174 ///\ref named-templ-func-param "named parameters",
1175 ///they are declared as the members of class \ref GraphToEps. The following
1176 ///example shows how to use these parameters.
1178 /// graphToEps(g,os).scale(10).coords(coords)
1179 /// .nodeScale(2).nodeSizes(sizes)
1180 /// .arcWidthScale(.4).run();
1182 ///\warning Don't forget to put the \ref GraphToEps::run() "run()"
1183 ///to the end of the parameter list.
1185 ///\sa graphToEps(G &g, const char *file_name)
1187 GraphToEps<DefaultGraphToEpsTraits<G> >
1188 graphToEps(G &g, std::ostream& os=std::cout)
1191 GraphToEps<DefaultGraphToEpsTraits<G> >(DefaultGraphToEpsTraits<G>(g,os));
1194 ///Generates an EPS file from a graph
1197 ///This function does the same as
1198 ///\ref graphToEps(G &g,std::ostream& os)
1199 ///but it writes its output into the file \c file_name
1200 ///instead of a stream.
1201 ///\sa graphToEps(G &g, std::ostream& os)
1203 GraphToEps<DefaultGraphToEpsTraits<G> >
1204 graphToEps(G &g,const char *file_name)
1206 return GraphToEps<DefaultGraphToEpsTraits<G> >
1207 (DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name),true));
1210 ///Generates an EPS file from a graph
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)
1219 GraphToEps<DefaultGraphToEpsTraits<G> >
1220 graphToEps(G &g,const std::string& file_name)
1222 return GraphToEps<DefaultGraphToEpsTraits<G> >
1223 (DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name.c_str()),true));
1226 } //END OF NAMESPACE LEMON
1228 #endif // LEMON_GRAPH_TO_EPS_H