1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
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
32 #define WIN32_LEAN_AND_MEAN
37 #include<lemon/math.h>
38 #include<lemon/core.h>
39 #include<lemon/dim2.h>
40 #include<lemon/maps.h>
41 #include<lemon/color.h>
42 #include<lemon/bits/bezier.h>
43 #include<lemon/error.h>
48 ///\brief A well configurable tool for visualizing graphs
52 namespace _graph_to_eps_bits {
56 typedef typename MT::Key Key;
57 typedef typename MT::Value Value;
60 _NegY(const MT &m,bool b) : map(m), yscale(1-b*2) {}
61 Value operator[](Key n) { return Value(map[n].x,map[n].y*yscale);}
65 ///Default traits class of GraphToEps
67 ///Default traits class of \ref GraphToEps.
69 ///\c G is the type of the underlying graph.
71 struct DefaultGraphToEpsTraits
74 typedef typename Graph::Node Node;
75 typedef typename Graph::NodeIt NodeIt;
76 typedef typename Graph::Arc Arc;
77 typedef typename Graph::ArcIt ArcIt;
78 typedef typename Graph::InArcIt InArcIt;
79 typedef typename Graph::OutArcIt OutArcIt;
86 typedef ConstMap<typename Graph::Node,dim2::Point<double> > CoordsMapType;
87 CoordsMapType _coords;
88 ConstMap<typename Graph::Node,double > _nodeSizes;
89 ConstMap<typename Graph::Node,int > _nodeShapes;
91 ConstMap<typename Graph::Node,Color > _nodeColors;
92 ConstMap<typename Graph::Arc,Color > _arcColors;
94 ConstMap<typename Graph::Arc,double > _arcWidths;
96 double _arcWidthScale;
99 double _xBorder, _yBorder;
101 double _nodeBorderQuotient;
104 double _arrowLength, _arrowWidth;
106 bool _showNodes, _showArcs;
108 bool _enableParallel;
112 ConstMap<typename Graph::Node,bool > _nodeTexts;
113 double _nodeTextSize;
115 bool _showNodePsText;
116 ConstMap<typename Graph::Node,bool > _nodePsTexts;
117 char *_nodePsTextsPreamble;
121 bool _pleaseRemoveOsStream;
126 std::string _copyright;
128 enum NodeTextColorType
129 { DIST_COL=0, DIST_BW=1, CUST_COL=2, SAME_COL=3 } _nodeTextColorType;
130 ConstMap<typename Graph::Node,Color > _nodeTextColors;
133 bool _autoArcWidthScale;
135 bool _absoluteNodeSizes;
136 bool _absoluteArcWidths;
144 ///\param _g Reference to the graph to be printed.
145 ///\param _os Reference to the output stream.
146 ///\param _os Reference to the output stream.
147 ///By default it is <tt>std::cout</tt>.
148 ///\param _pros If it is \c true, then the \c ostream referenced by \c _os
149 ///will be explicitly deallocated by the destructor.
150 DefaultGraphToEpsTraits(const G &_g,std::ostream& _os=std::cout,
153 _coords(dim2::Point<double>(1,1)), _nodeSizes(1), _nodeShapes(0),
154 _nodeColors(WHITE), _arcColors(BLACK),
155 _arcWidths(1.0), _arcWidthScale(0.003),
156 _nodeScale(.01), _xBorder(10), _yBorder(10), _scale(1.0),
157 _nodeBorderQuotient(.1),
158 _drawArrows(false), _arrowLength(1), _arrowWidth(0.3),
159 _showNodes(true), _showArcs(true),
160 _enableParallel(false), _parArcDist(1),
161 _showNodeText(false), _nodeTexts(false), _nodeTextSize(1),
162 _showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0),
163 _undirected(lemon::UndirectedTagIndicator<G>::value),
164 _pleaseRemoveOsStream(_pros), _scaleToA4(false),
165 _nodeTextColorType(SAME_COL), _nodeTextColors(BLACK),
166 _autoNodeScale(false),
167 _autoArcWidthScale(false),
168 _absoluteNodeSizes(false),
169 _absoluteArcWidths(false),
175 ///Auxiliary class to implement the named parameters of \ref graphToEps()
177 ///Auxiliary class to implement the named parameters of \ref graphToEps().
179 ///For detailed examples see the \ref graph_to_eps_demo.cc demo file.
180 template<class T> class GraphToEps : public T
182 // Can't believe it is required by the C++ standard
188 using T::_nodeShapes;
189 using T::_nodeColors;
193 using T::_arcWidthScale;
198 using T::_nodeBorderQuotient;
200 using T::_drawArrows;
201 using T::_arrowLength;
202 using T::_arrowWidth;
207 using T::_enableParallel;
208 using T::_parArcDist;
210 using T::_showNodeText;
212 using T::_nodeTextSize;
214 using T::_showNodePsText;
215 using T::_nodePsTexts;
216 using T::_nodePsTextsPreamble;
218 using T::_undirected;
220 using T::_pleaseRemoveOsStream;
227 using T::NodeTextColorType;
231 using T::_nodeTextColorType;
232 using T::_nodeTextColors;
234 using T::_autoNodeScale;
235 using T::_autoArcWidthScale;
237 using T::_absoluteNodeSizes;
238 using T::_absoluteArcWidths;
244 // dradnats ++C eht yb deriuqer si ti eveileb t'naC
246 typedef typename T::Graph Graph;
247 typedef typename Graph::Node Node;
248 typedef typename Graph::NodeIt NodeIt;
249 typedef typename Graph::Arc Arc;
250 typedef typename Graph::ArcIt ArcIt;
251 typedef typename Graph::InArcIt InArcIt;
252 typedef typename Graph::OutArcIt OutArcIt;
254 static const int INTERPOL_PREC;
255 static const double A4HEIGHT;
256 static const double A4WIDTH;
257 static const double A4BORDER;
268 ///\image html nodeshape_0.png
269 ///\image latex nodeshape_0.eps "CIRCLE shape (0)" width=2cm
272 ///\image html nodeshape_1.png
273 ///\image latex nodeshape_1.eps "SQUARE shape (1)" width=2cm
277 ///\image html nodeshape_2.png
278 ///\image latex nodeshape_2.eps "DIAMOND shape (2)" width=2cm
282 ///\image html nodeshape_3.png
283 ///\image latex nodeshape_2.eps "MALE shape (4)" width=2cm
287 ///\image html nodeshape_4.png
288 ///\image latex nodeshape_2.eps "FEMALE shape (4)" width=2cm
297 arcLess(const Graph &_g) : g(_g) {}
298 bool operator()(Arc a,Arc b) const
300 Node ai=std::min(g.source(a),g.target(a));
301 Node aa=std::max(g.source(a),g.target(a));
302 Node bi=std::min(g.source(b),g.target(b));
303 Node ba=std::max(g.source(b),g.target(b));
305 (ai==bi && (aa < ba ||
306 (aa==ba && ai==g.source(a) && bi==g.target(b))));
309 bool isParallel(Arc e,Arc f) const
311 return (g.source(e)==g.source(f)&&
312 g.target(e)==g.target(f)) ||
313 (g.source(e)==g.target(f)&&
314 g.target(e)==g.source(f));
317 static std::string psOut(const dim2::Point<TT> &p)
319 std::ostringstream os;
320 os << p.x << ' ' << p.y;
323 static std::string psOut(const Color &c)
325 std::ostringstream os;
326 os << c.red() << ' ' << c.green() << ' ' << c.blue();
331 GraphToEps(const T &t) : T(t), dontPrint(false) {};
333 template<class X> struct CoordsTraits : public T {
334 typedef X CoordsMapType;
336 CoordsTraits(const T &t,const X &x) : T(t), _coords(x) {}
338 ///Sets the map of the node coordinates
340 ///Sets the map of the node coordinates.
341 ///\param x must be a node map with \ref dim2::Point "dim2::Point<double>" or
342 ///\ref dim2::Point "dim2::Point<int>" values.
343 template<class X> GraphToEps<CoordsTraits<X> > coords(const X &x) {
345 return GraphToEps<CoordsTraits<X> >(CoordsTraits<X>(*this,x));
347 template<class X> struct NodeSizesTraits : public T {
349 NodeSizesTraits(const T &t,const X &x) : T(t), _nodeSizes(x) {}
351 ///Sets the map of the node sizes
353 ///Sets the map of the node sizes.
354 ///\param x must be a node map with \c double (or convertible) values.
355 template<class X> GraphToEps<NodeSizesTraits<X> > nodeSizes(const X &x)
358 return GraphToEps<NodeSizesTraits<X> >(NodeSizesTraits<X>(*this,x));
360 template<class X> struct NodeShapesTraits : public T {
361 const X &_nodeShapes;
362 NodeShapesTraits(const T &t,const X &x) : T(t), _nodeShapes(x) {}
364 ///Sets the map of the node shapes
366 ///Sets the map of the node shapes.
367 ///The available shape values
368 ///can be found in \ref NodeShapes "enum NodeShapes".
369 ///\param x must be a node map with \c int (or convertible) values.
371 template<class X> GraphToEps<NodeShapesTraits<X> > nodeShapes(const X &x)
374 return GraphToEps<NodeShapesTraits<X> >(NodeShapesTraits<X>(*this,x));
376 template<class X> struct NodeTextsTraits : public T {
378 NodeTextsTraits(const T &t,const X &x) : T(t), _nodeTexts(x) {}
380 ///Sets the text printed on the nodes
382 ///Sets the text printed on the nodes.
383 ///\param x must be a node map with type that can be pushed to a standard
385 template<class X> GraphToEps<NodeTextsTraits<X> > nodeTexts(const X &x)
389 return GraphToEps<NodeTextsTraits<X> >(NodeTextsTraits<X>(*this,x));
391 template<class X> struct NodePsTextsTraits : public T {
392 const X &_nodePsTexts;
393 NodePsTextsTraits(const T &t,const X &x) : T(t), _nodePsTexts(x) {}
395 ///Inserts a PostScript block to the nodes
397 ///With this command it is possible to insert a verbatim PostScript
398 ///block to the nodes.
399 ///The PS current point will be moved to the center of the node before
400 ///the PostScript block inserted.
402 ///Before and after the block a newline character is inserted so you
403 ///don't have to bother with the separators.
405 ///\param x must be a node map with type that can be pushed to a standard
408 ///\sa nodePsTextsPreamble()
409 template<class X> GraphToEps<NodePsTextsTraits<X> > nodePsTexts(const X &x)
412 _showNodePsText=true;
413 return GraphToEps<NodePsTextsTraits<X> >(NodePsTextsTraits<X>(*this,x));
415 template<class X> struct ArcWidthsTraits : public T {
417 ArcWidthsTraits(const T &t,const X &x) : T(t), _arcWidths(x) {}
419 ///Sets the map of the arc widths
421 ///Sets the map of the arc widths.
422 ///\param x must be an arc map with \c double (or convertible) values.
423 template<class X> GraphToEps<ArcWidthsTraits<X> > arcWidths(const X &x)
426 return GraphToEps<ArcWidthsTraits<X> >(ArcWidthsTraits<X>(*this,x));
429 template<class X> struct NodeColorsTraits : public T {
430 const X &_nodeColors;
431 NodeColorsTraits(const T &t,const X &x) : T(t), _nodeColors(x) {}
433 ///Sets the map of the node colors
435 ///Sets the map of the node colors.
436 ///\param x must be a node map with \ref Color values.
439 template<class X> GraphToEps<NodeColorsTraits<X> >
440 nodeColors(const X &x)
443 return GraphToEps<NodeColorsTraits<X> >(NodeColorsTraits<X>(*this,x));
445 template<class X> struct NodeTextColorsTraits : public T {
446 const X &_nodeTextColors;
447 NodeTextColorsTraits(const T &t,const X &x) : T(t), _nodeTextColors(x) {}
449 ///Sets the map of the node text colors
451 ///Sets the map of the node text colors.
452 ///\param x must be a node map with \ref Color values.
455 template<class X> GraphToEps<NodeTextColorsTraits<X> >
456 nodeTextColors(const X &x)
459 _nodeTextColorType=CUST_COL;
460 return GraphToEps<NodeTextColorsTraits<X> >
461 (NodeTextColorsTraits<X>(*this,x));
463 template<class X> struct ArcColorsTraits : public T {
465 ArcColorsTraits(const T &t,const X &x) : T(t), _arcColors(x) {}
467 ///Sets the map of the arc colors
469 ///Sets the map of the arc colors.
470 ///\param x must be an arc map with \ref Color values.
473 template<class X> GraphToEps<ArcColorsTraits<X> >
474 arcColors(const X &x)
477 return GraphToEps<ArcColorsTraits<X> >(ArcColorsTraits<X>(*this,x));
479 ///Sets a global scale factor for node sizes
481 ///Sets a global scale factor for node sizes.
483 /// If nodeSizes() is not given, this function simply sets the node
484 /// sizes to \c d. If nodeSizes() is given, but
485 /// autoNodeScale() is not, then the node size given by
486 /// nodeSizes() will be multiplied by the value \c d.
487 /// If both nodeSizes() and autoNodeScale() are used, then the
488 /// node sizes will be scaled in such a way that the greatest size will be
491 /// \sa autoNodeScale()
492 GraphToEps<T> &nodeScale(double d=.01) {_nodeScale=d;return *this;}
493 ///Turns on/off the automatic node size scaling.
495 ///Turns on/off the automatic node size scaling.
499 GraphToEps<T> &autoNodeScale(bool b=true) {
500 _autoNodeScale=b;return *this;
503 ///Turns on/off the absolutematic node size scaling.
505 ///Turns on/off the absolutematic node size scaling.
509 GraphToEps<T> &absoluteNodeSizes(bool b=true) {
510 _absoluteNodeSizes=b;return *this;
513 ///Negates the Y coordinates.
514 GraphToEps<T> &negateY(bool b=true) {
515 _negY=b;return *this;
518 ///Turn on/off pre-scaling
520 ///By default graphToEps() rescales the whole image in order to avoid
521 ///very big or very small bounding boxes.
523 ///This (p)rescaling can be turned off with this function.
525 GraphToEps<T> &preScale(bool b=true) {
526 _preScale=b;return *this;
529 ///Sets a global scale factor for arc widths
531 /// Sets a global scale factor for arc widths.
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
540 GraphToEps<T> &arcWidthScale(double d=.003) {_arcWidthScale=d;return *this;}
541 ///Turns on/off the automatic arc width scaling.
543 ///Turns on/off the automatic arc width scaling.
545 ///\sa arcWidthScale()
547 GraphToEps<T> &autoArcWidthScale(bool b=true) {
548 _autoArcWidthScale=b;return *this;
550 ///Turns on/off the absolutematic arc width scaling.
552 ///Turns on/off the absolutematic arc width scaling.
554 ///\sa arcWidthScale()
556 GraphToEps<T> &absoluteArcWidths(bool b=true) {
557 _absoluteArcWidths=b;return *this;
559 ///Sets a global scale factor for the whole picture
560 GraphToEps<T> &scale(double d) {_scale=d;return *this;}
561 ///Sets the width of the border around the picture
562 GraphToEps<T> &border(double b=10) {_xBorder=_yBorder=b;return *this;}
563 ///Sets the width of the border around the picture
564 GraphToEps<T> &border(double x, double y) {
565 _xBorder=x;_yBorder=y;return *this;
567 ///Sets whether to draw arrows
568 GraphToEps<T> &drawArrows(bool b=true) {_drawArrows=b;return *this;}
569 ///Sets the length of the arrowheads
570 GraphToEps<T> &arrowLength(double d=1.0) {_arrowLength*=d;return *this;}
571 ///Sets the width of the arrowheads
572 GraphToEps<T> &arrowWidth(double d=.3) {_arrowWidth*=d;return *this;}
574 ///Scales the drawing to fit to A4 page
575 GraphToEps<T> &scaleToA4() {_scaleToA4=true;return *this;}
577 ///Enables parallel arcs
578 GraphToEps<T> &enableParallel(bool b=true) {_enableParallel=b;return *this;}
580 ///Sets the distance between parallel arcs
581 GraphToEps<T> &parArcDist(double d) {_parArcDist*=d;return *this;}
584 GraphToEps<T> &hideArcs(bool b=true) {_showArcs=!b;return *this;}
586 GraphToEps<T> &hideNodes(bool b=true) {_showNodes=!b;return *this;}
588 ///Sets the size of the node texts
589 GraphToEps<T> &nodeTextSize(double d) {_nodeTextSize=d;return *this;}
591 ///Sets the color of the node texts to be different from the node color
593 ///Sets the color of the node texts to be as different from the node color
594 ///as it is possible.
595 GraphToEps<T> &distantColorNodeTexts()
596 {_nodeTextColorType=DIST_COL;return *this;}
597 ///Sets the color of the node texts to be black or white and always visible.
599 ///Sets the color of the node texts to be black or white according to
600 ///which is more different from the node color.
601 GraphToEps<T> &distantBWNodeTexts()
602 {_nodeTextColorType=DIST_BW;return *this;}
604 ///Gives a preamble block for node Postscript block.
606 ///Gives a preamble block for node Postscript block.
609 GraphToEps<T> & nodePsTextsPreamble(const char *str) {
610 _nodePsTextsPreamble=str ;return *this;
612 ///Sets whether the graph is undirected
614 ///Sets whether the graph is undirected.
616 ///This setting is the default for undirected graphs.
619 GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;}
621 ///Sets whether the graph is directed
623 ///Sets whether the graph is directed.
624 ///Use it to show the edges as a pair of directed ones.
626 ///This setting is the default for digraphs.
629 GraphToEps<T> &directed(bool b=true) {_undirected=!b;return *this;}
633 ///Sets the title of the generated image,
634 ///namely it inserts a <tt>%%Title:</tt> DSC field to the header of
636 GraphToEps<T> &title(const std::string &t) {_title=t;return *this;}
637 ///Sets the copyright statement.
639 ///Sets the copyright statement of the generated image,
640 ///namely it inserts a <tt>%%Copyright:</tt> DSC field to the header of
642 GraphToEps<T> ©right(const std::string &t) {_copyright=t;return *this;}
645 bool isInsideNode(dim2::Point<double> p, double r,int t)
651 return p.normSquare()<=r*r;
653 return p.x<=r&&p.x>=-r&&p.y<=r&&p.y>=-r;
655 return p.x+p.y<=r && p.x-p.y<=r && -p.x+p.y<=r && -p.x-p.y<=r;
665 ///Like other functions using
666 ///\ref named-templ-func-param "named template parameters",
667 ///this function calls the algorithm itself, i.e. in this case
668 ///it draws the graph.
670 const double EPSILON=1e-9;
671 if(dontPrint) return;
673 _graph_to_eps_bits::_NegY<typename T::CoordsMapType>
674 mycoords(_coords,_negY);
676 os << "%!PS-Adobe-2.0 EPSF-2.0\n";
677 if(_title.size()>0) os << "%%Title: " << _title << '\n';
678 if(_copyright.size()>0) os << "%%Copyright: " << _copyright << '\n';
679 os << "%%Creator: LEMON, graphToEps()\n";
684 gettimeofday(&tv, 0);
687 ctime_r(&tv.tv_sec,cbuf);
688 os << "%%CreationDate: " << cbuf;
691 GetSystemTime(&time);
692 #if defined(_MSC_VER) && (_MSC_VER < 1500)
693 LPWSTR buf1, buf2, buf3;
694 if (GetDateFormat(LOCALE_USER_DEFAULT, 0, &time,
695 L"ddd MMM dd", buf1, 11) &&
696 GetTimeFormat(LOCALE_USER_DEFAULT, 0, &time,
697 L"HH':'mm':'ss", buf2, 9) &&
698 GetDateFormat(LOCALE_USER_DEFAULT, 0, &time,
700 os << "%%CreationDate: " << buf1 << ' '
701 << buf2 << ' ' << buf3 << std::endl;
704 char buf1[11], buf2[9], buf3[5];
705 if (GetDateFormat(LOCALE_USER_DEFAULT, 0, &time,
706 "ddd MMM dd", buf1, 11) &&
707 GetTimeFormat(LOCALE_USER_DEFAULT, 0, &time,
708 "HH':'mm':'ss", buf2, 9) &&
709 GetDateFormat(LOCALE_USER_DEFAULT, 0, &time,
711 os << "%%CreationDate: " << buf1 << ' '
712 << buf2 << ' ' << buf3 << std::endl;
718 if (_autoArcWidthScale) {
720 for(ArcIt e(g);e!=INVALID;++e)
721 max_w=std::max(double(_arcWidths[e]),max_w);
723 _arcWidthScale/=max_w;
727 if (_autoNodeScale) {
729 for(NodeIt n(g);n!=INVALID;++n)
730 max_s=std::max(double(_nodeSizes[n]),max_s);
737 if(!(_absoluteNodeSizes&&_absoluteArcWidths)) {
738 dim2::Box<double> bb;
739 for(NodeIt n(g);n!=INVALID;++n) bb.add(mycoords[n]);
741 bb = dim2::Box<double>(dim2::Point<double>(0,0));
743 diag_len = std::sqrt((bb.bottomLeft()-bb.topRight()).normSquare());
744 if(diag_len<EPSILON) diag_len = 1;
745 if(!_absoluteNodeSizes) _nodeScale*=diag_len;
746 if(!_absoluteArcWidths) _arcWidthScale*=diag_len;
749 dim2::Box<double> bb;
750 for(NodeIt n(g);n!=INVALID;++n) {
751 double ns=_nodeSizes[n]*_nodeScale;
752 dim2::Point<double> p(ns,ns);
753 switch(_nodeShapes[n]) {
757 bb.add(p+mycoords[n]);
758 bb.add(-p+mycoords[n]);
761 bb.add(-p+mycoords[n]);
762 bb.add(dim2::Point<double>(1.5*ns,1.5*std::sqrt(3.0)*ns)+mycoords[n]);
765 bb.add(p+mycoords[n]);
766 bb.add(dim2::Point<double>(-ns,-3.01*ns)+mycoords[n]);
771 bb = dim2::Box<double>(dim2::Point<double>(0,0));
775 os <<"%%BoundingBox: 0 0 596 842\n%%DocumentPaperSizes: a4\n";
778 //Rescale so that BoundingBox won't be neither to big nor too small.
779 while(bb.height()*_scale>1000||bb.width()*_scale>1000) _scale/=10;
780 while(bb.height()*_scale<100||bb.width()*_scale<100) _scale*=10;
783 os << "%%BoundingBox: "
784 << int(floor(bb.left() * _scale - _xBorder)) << ' '
785 << int(floor(bb.bottom() * _scale - _yBorder)) << ' '
786 << int(ceil(bb.right() * _scale + _xBorder)) << ' '
787 << int(ceil(bb.top() * _scale + _yBorder)) << '\n';
790 os << "%%EndComments\n";
792 //x1 y1 x2 y2 x3 y3 cr cg cb w
793 os << "/lb { setlinewidth setrgbcolor newpath moveto\n"
794 << " 4 2 roll 1 index 1 index curveto stroke } bind def\n";
795 os << "/l { setlinewidth setrgbcolor newpath moveto lineto stroke }"
798 os << "/c { newpath dup 3 index add 2 index moveto 0 360 arc closepath }"
801 os << "/sq { newpath 2 index 1 index add 2 index 2 index add moveto\n"
802 << " 2 index 1 index sub 2 index 2 index add lineto\n"
803 << " 2 index 1 index sub 2 index 2 index sub lineto\n"
804 << " 2 index 1 index add 2 index 2 index sub lineto\n"
805 << " closepath pop pop pop} bind def\n";
807 os << "/di { newpath 2 index 1 index add 2 index moveto\n"
808 << " 2 index 2 index 2 index add lineto\n"
809 << " 2 index 1 index sub 2 index lineto\n"
810 << " 2 index 2 index 2 index sub lineto\n"
811 << " closepath pop pop pop} bind def\n";
813 os << "/nc { 0 0 0 setrgbcolor 5 index 5 index 5 index c fill\n"
814 << " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
816 os << "/nsq { 0 0 0 setrgbcolor 5 index 5 index 5 index sq fill\n"
817 << " setrgbcolor " << 1+_nodeBorderQuotient << " div sq fill\n"
819 os << "/ndi { 0 0 0 setrgbcolor 5 index 5 index 5 index di fill\n"
820 << " setrgbcolor " << 1+_nodeBorderQuotient << " div di fill\n"
822 os << "/nfemale { 0 0 0 setrgbcolor 3 index "
823 << _nodeBorderQuotient/(1+_nodeBorderQuotient)
824 << " 1.5 mul mul setlinewidth\n"
825 << " newpath 5 index 5 index moveto "
826 << "5 index 5 index 5 index 3.01 mul sub\n"
827 << " lineto 5 index 4 index .7 mul sub 5 index 5 index 2.2 mul sub"
829 << " 5 index 4 index .7 mul add 5 index 5 index 2.2 mul sub lineto "
831 << " 5 index 5 index 5 index c fill\n"
832 << " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
835 << " 0 0 0 setrgbcolor 3 index "
836 << _nodeBorderQuotient/(1+_nodeBorderQuotient)
837 <<" 1.5 mul mul setlinewidth\n"
838 << " newpath 5 index 5 index moveto\n"
839 << " 5 index 4 index 1 mul 1.5 mul add\n"
840 << " 5 index 5 index 3 sqrt 1.5 mul mul add\n"
841 << " 1 index 1 index lineto\n"
842 << " 1 index 1 index 7 index sub moveto\n"
843 << " 1 index 1 index lineto\n"
844 << " exch 5 index 3 sqrt .5 mul mul sub exch 5 index .5 mul sub"
847 << " 5 index 5 index 5 index c fill\n"
848 << " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n"
852 os << "/arrl " << _arrowLength << " def\n";
853 os << "/arrw " << _arrowWidth << " def\n";
855 os << "/lrl { 2 index mul exch 2 index mul exch rlineto pop} bind def\n";
856 //len w dx_norm dy_norm x1 y1 cr cg cb
857 os << "/arr { setrgbcolor /y1 exch def /x1 exch def /dy exch def /dx "
859 << " /w exch def /len exch def\n"
860 //<< "0.1 setlinewidth x1 y1 moveto dx len mul dy len mul rlineto stroke"
861 << " newpath x1 dy w 2 div mul add y1 dx w 2 div mul sub moveto\n"
862 << " len w sub arrl sub dx dy lrl\n"
863 << " arrw dy dx neg lrl\n"
864 << " dx arrl w add mul dy w 2 div arrw add mul sub\n"
865 << " dy arrl w add mul dx w 2 div arrw add mul add rlineto\n"
866 << " dx arrl w add mul neg dy w 2 div arrw add mul sub\n"
867 << " dy arrl w add mul neg dx w 2 div arrw add mul add rlineto\n"
868 << " arrw dy dx neg lrl\n"
869 << " len w sub arrl sub neg dx dy lrl\n"
870 << " closepath fill } bind def\n";
871 os << "/cshow { 2 index 2 index moveto dup stringwidth pop\n"
872 << " neg 2 div fosi .35 mul neg rmoveto show pop pop} def\n";
876 if(bb.height()>bb.width()) {
877 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(),
878 (A4WIDTH-2*A4BORDER)/bb.width());
879 os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' '
880 << ((A4HEIGHT-2*A4BORDER)-sc*bb.height())/2 + A4BORDER
882 << sc << " dup scale\n"
883 << -bb.left() << ' ' << -bb.bottom() << " translate\n";
886 double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(),
887 (A4WIDTH-2*A4BORDER)/bb.height());
888 os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' '
889 << ((A4HEIGHT-2*A4BORDER)-sc*bb.width())/2 + A4BORDER
891 << sc << " dup scale\n90 rotate\n"
892 << -bb.left() << ' ' << -bb.top() << " translate\n";
894 else if(_scale!=1.0) os << _scale << " dup scale\n";
897 os << "%Arcs:\ngsave\n";
898 if(_enableParallel) {
900 for(ArcIt e(g);e!=INVALID;++e)
901 if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
902 &&g.source(e)!=g.target(e))
904 std::sort(el.begin(),el.end(),arcLess(g));
906 typename std::vector<Arc>::iterator j;
907 for(typename std::vector<Arc>::iterator i=el.begin();i!=el.end();i=j) {
908 for(j=i+1;j!=el.end()&&isParallel(*i,*j);++j) ;
911 for(typename std::vector<Arc>::iterator e=i;e!=j;++e)
912 sw+=_arcWidths[*e]*_arcWidthScale+_parArcDist;
916 dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]);
917 double l=std::sqrt(dvec.normSquare());
918 dim2::Point<double> d(dvec/std::max(l,EPSILON));
919 dim2::Point<double> m;
920 // m=dim2::Point<double>(mycoords[g.target(*i)]+
921 // mycoords[g.source(*i)])/2.0;
923 // m=dim2::Point<double>(mycoords[g.source(*i)])+
924 // dvec*(double(_nodeSizes[g.source(*i)])/
925 // (_nodeSizes[g.source(*i)]+_nodeSizes[g.target(*i)]));
927 m=dim2::Point<double>(mycoords[g.source(*i)])+
928 d*(l+_nodeSizes[g.source(*i)]-_nodeSizes[g.target(*i)])/2.0;
930 for(typename std::vector<Arc>::iterator e=i;e!=j;++e) {
931 sw+=_arcWidths[*e]*_arcWidthScale/2.0;
932 dim2::Point<double> mm=m+rot90(d)*sw/.75;
935 dim2::Point<double> s=mycoords[g.source(*e)];
936 dim2::Point<double> t=mycoords[g.target(*e)];
937 double rn=_nodeSizes[g.target(*e)]*_nodeScale;
938 node_shape=_nodeShapes[g.target(*e)];
939 dim2::Bezier3 bez(s,mm,mm,t);
941 for(int ii=0;ii<INTERPOL_PREC;++ii)
942 if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t2=(t1+t2)/2;
944 dim2::Point<double> apoint=bez((t1+t2)/2);
945 rn = _arrowLength+_arcWidths[*e]*_arcWidthScale;
948 for(int ii=0;ii<INTERPOL_PREC;++ii)
949 if((bez((t1+t2)/2)-apoint).normSquare()>rn) t1=(t1+t2)/2;
951 dim2::Point<double> linend=bez((t1+t2)/2);
952 bez=bez.before((t1+t2)/2);
953 // rn=_nodeSizes[g.source(*e)]*_nodeScale;
954 // node_shape=_nodeShapes[g.source(*e)];
956 // for(int i=0;i<INTERPOL_PREC;++i)
957 // if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape))
959 // else t2=(t1+t2)/2;
960 // bez=bez.after((t1+t2)/2);
961 os << _arcWidths[*e]*_arcWidthScale << " setlinewidth "
962 << _arcColors[*e].red() << ' '
963 << _arcColors[*e].green() << ' '
964 << _arcColors[*e].blue() << " setrgbcolor newpath\n"
965 << bez.p1.x << ' ' << bez.p1.y << " moveto\n"
966 << bez.p2.x << ' ' << bez.p2.y << ' '
967 << bez.p3.x << ' ' << bez.p3.y << ' '
968 << bez.p4.x << ' ' << bez.p4.y << " curveto stroke\n";
969 dim2::Point<double> dd(rot90(linend-apoint));
970 dd*=(.5*_arcWidths[*e]*_arcWidthScale+_arrowWidth)/
971 std::sqrt(dd.normSquare());
972 os << "newpath " << psOut(apoint) << " moveto "
973 << psOut(linend+dd) << " lineto "
974 << psOut(linend-dd) << " lineto closepath fill\n";
977 os << mycoords[g.source(*e)].x << ' '
978 << mycoords[g.source(*e)].y << ' '
979 << mm.x << ' ' << mm.y << ' '
980 << mycoords[g.target(*e)].x << ' '
981 << mycoords[g.target(*e)].y << ' '
982 << _arcColors[*e].red() << ' '
983 << _arcColors[*e].green() << ' '
984 << _arcColors[*e].blue() << ' '
985 << _arcWidths[*e]*_arcWidthScale << " lb\n";
987 sw+=_arcWidths[*e]*_arcWidthScale/2.0+_parArcDist;
991 else for(ArcIt e(g);e!=INVALID;++e)
992 if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0
993 &&g.source(e)!=g.target(e)) {
995 dim2::Point<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);
996 double rn=_nodeSizes[g.target(e)]*_nodeScale;
997 int node_shape=_nodeShapes[g.target(e)];
999 for(int i=0;i<INTERPOL_PREC;++i)
1000 if(isInsideNode((-(t1+t2)/2)*d,rn,node_shape)) t1=(t1+t2)/2;
1002 double l=std::sqrt(d.normSquare());
1005 os << l*(1-(t1+t2)/2) << ' '
1006 << _arcWidths[e]*_arcWidthScale << ' '
1007 << d.x << ' ' << d.y << ' '
1008 << mycoords[g.source(e)].x << ' '
1009 << mycoords[g.source(e)].y << ' '
1010 << _arcColors[e].red() << ' '
1011 << _arcColors[e].green() << ' '
1012 << _arcColors[e].blue() << " arr\n";
1014 else os << mycoords[g.source(e)].x << ' '
1015 << mycoords[g.source(e)].y << ' '
1016 << mycoords[g.target(e)].x << ' '
1017 << mycoords[g.target(e)].y << ' '
1018 << _arcColors[e].red() << ' '
1019 << _arcColors[e].green() << ' '
1020 << _arcColors[e].blue() << ' '
1021 << _arcWidths[e]*_arcWidthScale << " l\n";
1026 os << "%Nodes:\ngsave\n";
1027 for(NodeIt n(g);n!=INVALID;++n) {
1028 os << mycoords[n].x << ' ' << mycoords[n].y << ' '
1029 << _nodeSizes[n]*_nodeScale << ' '
1030 << _nodeColors[n].red() << ' '
1031 << _nodeColors[n].green() << ' '
1032 << _nodeColors[n].blue() << ' ';
1033 switch(_nodeShapes[n]) {
1043 os<< "nfemale";break;
1050 os << "%Node texts:\ngsave\n";
1051 os << "/fosi " << _nodeTextSize << " def\n";
1052 os << "(Helvetica) findfont fosi scalefont setfont\n";
1053 for(NodeIt n(g);n!=INVALID;++n) {
1054 switch(_nodeTextColorType) {
1056 os << psOut(distantColor(_nodeColors[n])) << " setrgbcolor\n";
1059 os << psOut(distantBW(_nodeColors[n])) << " setrgbcolor\n";
1062 os << psOut(distantColor(_nodeTextColors[n])) << " setrgbcolor\n";
1065 os << "0 0 0 setrgbcolor\n";
1067 os << mycoords[n].x << ' ' << mycoords[n].y
1068 << " (" << _nodeTexts[n] << ") cshow\n";
1072 if(_showNodePsText) {
1073 os << "%Node PS blocks:\ngsave\n";
1074 for(NodeIt n(g);n!=INVALID;++n)
1075 os << mycoords[n].x << ' ' << mycoords[n].y
1076 << " moveto\n" << _nodePsTexts[n] << "\n";
1080 os << "grestore\nshowpage\n";
1083 if(_pleaseRemoveOsStream) {delete &os;}
1087 ///These are just some aliases to other parameter setting functions.
1091 ///An alias for arcWidths()
1092 template<class X> GraphToEps<ArcWidthsTraits<X> > edgeWidths(const X &x)
1094 return arcWidths(x);
1097 ///An alias for arcColors()
1098 template<class X> GraphToEps<ArcColorsTraits<X> >
1099 edgeColors(const X &x)
1101 return arcColors(x);
1104 ///An alias for arcWidthScale()
1105 GraphToEps<T> &edgeWidthScale(double d) {return arcWidthScale(d);}
1107 ///An alias for autoArcWidthScale()
1108 GraphToEps<T> &autoEdgeWidthScale(bool b=true)
1110 return autoArcWidthScale(b);
1113 ///An alias for absoluteArcWidths()
1114 GraphToEps<T> &absoluteEdgeWidths(bool b=true)
1116 return absoluteArcWidths(b);
1119 ///An alias for parArcDist()
1120 GraphToEps<T> &parEdgeDist(double d) {return parArcDist(d);}
1122 ///An alias for hideArcs()
1123 GraphToEps<T> &hideEdges(bool b=true) {return hideArcs(b);}
1129 const int GraphToEps<T>::INTERPOL_PREC = 20;
1131 const double GraphToEps<T>::A4HEIGHT = 841.8897637795276;
1133 const double GraphToEps<T>::A4WIDTH = 595.275590551181;
1135 const double GraphToEps<T>::A4BORDER = 15;
1138 ///Generates an EPS file from a graph
1141 ///Generates an EPS file from a graph.
1142 ///\param g Reference to the graph to be printed.
1143 ///\param os Reference to the output stream.
1144 ///By default it is <tt>std::cout</tt>.
1146 ///This function also has a lot of
1147 ///\ref named-templ-func-param "named parameters",
1148 ///they are declared as the members of class \ref GraphToEps. The following
1149 ///example shows how to use these parameters.
1151 /// graphToEps(g,os).scale(10).coords(coords)
1152 /// .nodeScale(2).nodeSizes(sizes)
1153 /// .arcWidthScale(.4).run();
1156 ///For more detailed examples see the \ref graph_to_eps_demo.cc demo file.
1158 ///\warning Don't forget to put the \ref GraphToEps::run() "run()"
1159 ///to the end of the parameter list.
1161 ///\sa graphToEps(G &g, const char *file_name)
1163 GraphToEps<DefaultGraphToEpsTraits<G> >
1164 graphToEps(G &g, std::ostream& os=std::cout)
1167 GraphToEps<DefaultGraphToEpsTraits<G> >(DefaultGraphToEpsTraits<G>(g,os));
1170 ///Generates an EPS file from a graph
1173 ///This function does the same as
1174 ///\ref graphToEps(G &g,std::ostream& os)
1175 ///but it writes its output into the file \c file_name
1176 ///instead of a stream.
1177 ///\sa graphToEps(G &g, std::ostream& os)
1179 GraphToEps<DefaultGraphToEpsTraits<G> >
1180 graphToEps(G &g,const char *file_name)
1182 std::ostream* os = new std::ofstream(file_name);
1185 throw IoError("Cannot write file", file_name);
1187 return GraphToEps<DefaultGraphToEpsTraits<G> >
1188 (DefaultGraphToEpsTraits<G>(g,*os,true));
1191 ///Generates an EPS file from a graph
1194 ///This function does the same as
1195 ///\ref graphToEps(G &g,std::ostream& os)
1196 ///but it writes its output into the file \c file_name
1197 ///instead of a stream.
1198 ///\sa graphToEps(G &g, std::ostream& os)
1200 GraphToEps<DefaultGraphToEpsTraits<G> >
1201 graphToEps(G &g,const std::string& file_name)
1203 std::ostream* os = new std::ofstream(file_name.c_str());
1206 throw IoError("Cannot write file", file_name);
1208 return GraphToEps<DefaultGraphToEpsTraits<G> >
1209 (DefaultGraphToEpsTraits<G>(g,*os,true));
1212 } //END OF NAMESPACE LEMON
1214 #endif // LEMON_GRAPH_TO_EPS_H