COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/lemon/graph_to_eps.h @ 1088:358526a620f8

Last change on this file since 1088:358526a620f8 was 1088:358526a620f8, checked in by Alpar Juttner, 15 years ago

One more node-shape added.

File size: 22.9 KB
Line 
1/* -*- C++ -*-
2 * src/lemon/graph_to_eps.h - Part of LEMON, a generic C++ optimization library
3 *
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Combinatorial Optimization Research Group, EGRES).
6 *
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
10 *
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
13 * purpose.
14 *
15 */
16
17#ifndef LEMON_GRAPH_TO_EPS_H
18#define LEMON_GRAPH_TO_EPS_H
19
20#include<iostream>
21#include<fstream>
22#include<sstream>
23#include<algorithm>
24#include<vector>
25
26#include<lemon/xy.h>
27#include<lemon/maps.h>
28#include<lemon/bezier.h>
29
30///\ingroup misc
31///\file
32///\brief Simple graph drawer
33///
34///\author Alpar Juttner
35
36namespace lemon {
37
38///Data structure representing RGB colors.
39
40///Data structure representing RGB colors.
41///\ingroup misc
42class Color
43{
44  double _r,_g,_b;
45public:
46  ///Default constructor
47  Color() {}
48  ///Constructor
49  Color(double r,double g,double b) :_r(r),_g(g),_b(b) {};
50  ///Returns the red component
51  double getR() {return _r;}
52  ///Returns the green component
53  double getG() {return _g;}
54  ///Returns the blue component
55  double getB() {return _b;}
56  ///Set the color components
57  void set(double r,double g,double b) { _r=r;_g=g;_b=b; };
58};
59 
60///Default traits class of \ref GraphToEps
61
62///Default traits class of \ref GraphToEps
63///
64///\c G is the type of the underlying graph.
65template<class G>
66struct DefaultGraphToEpsTraits
67{
68  typedef G Graph;
69  typedef typename Graph::Node Node;
70  typedef typename Graph::NodeIt NodeIt;
71  typedef typename Graph::Edge Edge;
72  typedef typename Graph::EdgeIt EdgeIt;
73  typedef typename Graph::InEdgeIt InEdgeIt;
74  typedef typename Graph::OutEdgeIt OutEdgeIt;
75 
76
77  const Graph &g;
78
79  std::ostream& os;
80 
81  ConstMap<typename Graph::Node,xy<double> > _coords;
82  ConstMap<typename Graph::Node,double > _nodeSizes;
83  ConstMap<typename Graph::Node,int > _nodeShapes;
84
85  ConstMap<typename Graph::Node,Color > _nodeColors;
86  ConstMap<typename Graph::Edge,Color > _edgeColors;
87
88  ConstMap<typename Graph::Edge,double > _edgeWidths;
89 
90  double _edgeWidthScale;
91 
92  double _nodeScale;
93  double _xBorder, _yBorder;
94  double _scale;
95  double _nodeBorderQuotient;
96 
97  bool _drawArrows;
98  double _arrowLength, _arrowWidth;
99 
100  bool _showNodes, _showEdges;
101
102  bool _enableParallel;
103  double _parEdgeDist;
104
105  bool _showNodeText;
106  ConstMap<typename Graph::Node,bool > _nodeTexts; 
107  double _nodeTextSize;
108
109  bool _showNodePsText;
110  ConstMap<typename Graph::Node,bool > _nodePsTexts; 
111  char *_nodePsTextsPreamble;
112 
113  bool _undir;
114  bool _pleaseRemoveOsStream;
115  ///Constructor
116
117  ///Constructor
118  ///\param _g is a reference to the graph to be printed
119  ///\param _os is a reference to the output stream.
120  ///\param _os is a reference to the output stream.
121  ///\param _pros If it is \c true, then the \c ostream referenced by \c _os
122  ///will be explicitly deallocated by the destructor.
123  ///By default it is <tt>std::cout</tt>
124  DefaultGraphToEpsTraits(const G &_g,std::ostream& _os=std::cout,
125                          bool _pros=false) :
126    g(_g), os(_os),
127    _coords(xy<double>(1,1)), _nodeSizes(1.0), _nodeShapes(0),
128    _nodeColors(Color(1,1,1)), _edgeColors(Color(0,0,0)),
129    _edgeWidths(1), _edgeWidthScale(0.3),
130    _nodeScale(1.0), _xBorder(10), _yBorder(10), _scale(1.0),
131    _nodeBorderQuotient(.1),
132    _drawArrows(false), _arrowLength(1), _arrowWidth(0.3),
133    _showNodes(true), _showEdges(true),
134    _enableParallel(false), _parEdgeDist(1),
135    _showNodeText(false), _nodeTexts(false), _nodeTextSize(1),
136    _showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0),
137    _undir(false),
138    _pleaseRemoveOsStream(_pros) {}
139};
140
141///Helper class to implement the named parameters of \ref graphToEps()
142
143///Helper class to implement the named parameters of \ref graphToEps()
144///\todo Is 'helper class' a good name for this?
145///
146template<class T> class GraphToEps : public T
147{
148  typedef typename T::Graph Graph;
149  typedef typename Graph::Node Node;
150  typedef typename Graph::NodeIt NodeIt;
151  typedef typename Graph::Edge Edge;
152  typedef typename Graph::EdgeIt EdgeIt;
153  typedef typename Graph::InEdgeIt InEdgeIt;
154  typedef typename Graph::OutEdgeIt OutEdgeIt;
155
156  static const int INTERPOL_PREC=20;
157
158  bool dontPrint;
159
160  enum NodeShapes { CIRCLE=0, SQUARE=1, DIAMOND=2 };
161                   
162  class edgeLess {
163    const Graph &g;
164  public:
165    edgeLess(const Graph &_g) : g(_g) {}
166    bool operator()(Edge a,Edge b) const
167    {
168      Node ai=min(g.source(a),g.target(a));
169      Node aa=max(g.source(a),g.target(a));
170      Node bi=min(g.source(b),g.target(b));
171      Node ba=max(g.source(b),g.target(b));
172      return ai<bi ||
173        (ai==bi && (aa < ba ||
174                    (aa==ba && ai==g.source(a) && bi==g.target(b))));
175    }
176  };
177  bool isParallel(Edge e,Edge f) const
178  {
179    return (g.source(e)==g.source(f)&&g.target(e)==g.target(f))||
180      (g.source(e)==g.target(f)&&g.target(e)==g.source(f));
181  }
182  static xy<double> rot(xy<double> v)
183  {
184    return xy<double>(v.y,-v.x);
185  }
186  template<class xy>
187  static std::string psOut(const xy &p)
188    {
189      std::ostringstream os;   
190      os << p.x << ' ' << p.y;
191      return os.str();
192    }
193 
194public:
195  GraphToEps(const T &t) : T(t), dontPrint(false) {};
196 
197  template<class X> struct CoordsTraits : public T {
198    const X &_coords;
199    CoordsTraits(const T &t,const X &x) : T(t), _coords(x) {}
200  };
201  ///Sets the map of the node coordinates
202
203  ///Sets the map of the node coordinates.
204  ///\param x must be a node map with xy<double> or xy<int> values.
205  template<class X> GraphToEps<CoordsTraits<X> > coords(const X &x) {
206    dontPrint=true;
207    return GraphToEps<CoordsTraits<X> >(CoordsTraits<X>(*this,x));
208  }
209  template<class X> struct NodeSizesTraits : public T {
210    const X &_nodeSizes;
211    NodeSizesTraits(const T &t,const X &x) : T(t), _nodeSizes(x) {}
212  };
213  ///Sets the map of the node sizes
214
215  ///Sets the map of the node sizes
216  ///\param x must be a node map with \c double (or convertible) values.
217  template<class X> GraphToEps<NodeSizesTraits<X> > nodeSizes(const X &x)
218  {
219    dontPrint=true;
220    return GraphToEps<NodeSizesTraits<X> >(NodeSizesTraits<X>(*this,x));
221  }
222  template<class X> struct NodeShapesTraits : public T {
223    const X &_nodeShapes;
224    NodeShapesTraits(const T &t,const X &x) : T(t), _nodeShapes(x) {}
225  };
226  ///Sets the map of the node shapes
227
228  ///Sets the map of the node shapes
229  ///\param x must be a node map with \c int (or convertible) values.
230  ///\todo Incomplete doc.
231  template<class X> GraphToEps<NodeShapesTraits<X> > nodeShapes(const X &x)
232  {
233    dontPrint=true;
234    return GraphToEps<NodeShapesTraits<X> >(NodeShapesTraits<X>(*this,x));
235  }
236  template<class X> struct NodeTextsTraits : public T {
237    const X &_nodeTexts;
238    NodeTextsTraits(const T &t,const X &x) : T(t), _nodeTexts(x) {}
239  };
240  ///Sets the text printed on the nodes
241
242  ///Sets the text printed on the nodes
243  ///\param x must be a node map with type that can be pushed to a standard
244  ///ostream.
245  template<class X> GraphToEps<NodeTextsTraits<X> > nodeTexts(const X &x)
246  {
247    dontPrint=true;
248    _showNodeText=true;
249    return GraphToEps<NodeTextsTraits<X> >(NodeTextsTraits<X>(*this,x));
250  }
251  template<class X> struct NodePsTextsTraits : public T {
252    const X &_nodePsTexts;
253    NodePsTextsTraits(const T &t,const X &x) : T(t), _nodePsTexts(x) {}
254  };
255  ///Inserts a PostScript block to the nodes
256
257  ///With this command it is possible to insert a verbatim PostScript
258  ///block to the nodes.
259  ///The PS current point will be moved to the centre of the node before
260  ///the PostScript block inserted.
261  ///
262  ///Before and after the block a newline character is inserted to you
263  ///don't have to bother with the separators.
264  ///
265  ///\param x must be a node map with type that can be pushed to a standard
266  ///ostream.
267  ///
268  ///\sa nodePsTextsPreamble()
269  ///\todo Offer the choise not to move to the centre but pass the coordinates
270  ///to the Postscript block inserted.
271  template<class X> GraphToEps<NodePsTextsTraits<X> > nodePsTexts(const X &x)
272  {
273    dontPrint=true;
274    _showNodePsText=true;
275    return GraphToEps<NodePsTextsTraits<X> >(NodePsTextsTraits<X>(*this,x));
276  }
277  template<class X> struct EdgeWidthsTraits : public T {
278    const X &_edgeWidths;
279    EdgeWidthsTraits(const T &t,const X &x) : T(t), _edgeWidths(x) {}
280  };
281  ///Sets the map of the edge widths
282
283  ///Sets the map of the edge widths
284  ///\param x must be a edge map with \c double (or convertible) values.
285  template<class X> GraphToEps<EdgeWidthsTraits<X> > edgeWidths(const X &x)
286  {
287    dontPrint=true;
288    return GraphToEps<EdgeWidthsTraits<X> >(EdgeWidthsTraits<X>(*this,x));
289  }
290
291  template<class X> struct NodeColorsTraits : public T {
292    const X &_nodeColors;
293    NodeColorsTraits(const T &t,const X &x) : T(t), _nodeColors(x) {}
294  };
295  ///Sets the map of the node colors
296
297  ///Sets the map of the node colors
298  ///\param x must be a node map with \ref Color values.
299  template<class X> GraphToEps<NodeColorsTraits<X> >
300  nodeColors(const X &x)
301  {
302    dontPrint=true;
303    return GraphToEps<NodeColorsTraits<X> >(NodeColorsTraits<X>(*this,x));
304  }
305  template<class X> struct EdgeColorsTraits : public T {
306    const X &_edgeColors;
307    EdgeColorsTraits(const T &t,const X &x) : T(t), _edgeColors(x) {}
308  };
309  ///Sets the map of the edge colors
310
311  ///Sets the map of the edge colors
312  ///\param x must be a edge map with \ref Color values.
313  template<class X> GraphToEps<EdgeColorsTraits<X> >
314  edgeColors(const X &x)
315  {
316    dontPrint=true;
317    return GraphToEps<EdgeColorsTraits<X> >(EdgeColorsTraits<X>(*this,x));
318  }
319  ///Sets a global scale factor for node sizes
320
321  ///Sets a global scale factor for node sizes
322  ///
323  GraphToEps<T> &nodeScale(double d) {_nodeScale=d;return *this;}
324  ///Sets a global scale factor for edge widths
325
326  ///Sets a global scale factor for edge widths
327  ///
328  GraphToEps<T> &edgeWidthScale(double d) {_edgeWidthScale=d;return *this;}
329  ///Sets a global scale factor for the whole picture
330
331  ///Sets a global scale factor for the whole picture
332  ///
333  GraphToEps<T> &scale(double d) {_scale=d;return *this;}
334  ///Sets the width of the border around the picture
335
336  ///Sets the width of the border around the picture
337  ///
338  GraphToEps<T> &border(double b) {_xBorder=_yBorder=b;return *this;}
339  ///Sets the width of the border around the picture
340
341  ///Sets the width of the border around the picture
342  ///
343  GraphToEps<T> &border(double x, double y) {
344    _xBorder=x;_yBorder=y;return *this;
345  }
346  ///Sets whether to draw arrows
347
348  ///Sets whether to draw arrows
349  ///
350  GraphToEps<T> &drawArrows(bool b=true) {_drawArrows=b;return *this;}
351  ///Sets the length of the arrowheads
352
353  ///Sets the length of the arrowheads
354  ///
355  GraphToEps<T> &arrowLength(double d) {_arrowLength*=d;return *this;}
356  ///Sets the width of the arrowheads
357
358  ///Sets the width of the arrowheads
359  ///
360  GraphToEps<T> &arrowWidth(double d) {_arrowWidth*=d;return *this;}
361 
362  ///Enables parallel edges
363
364  ///Enables parallel edges
365  ///\todo Partially implemented
366  GraphToEps<T> &enableParallel(bool b=true) {_enableParallel=b;return *this;}
367 
368  ///Sets the distance
369 
370  ///Sets the distance
371  ///
372  GraphToEps<T> &parEdgeDist(double d) {_parEdgeDist*=d;return *this;}
373 
374  ///Hides the edges
375 
376  ///Hides the edges
377  ///
378  GraphToEps<T> &hideEdges(bool b=true) {_showEdges=!b;return *this;}
379  ///Hides the nodes
380 
381  ///Hides the nodes
382  ///
383  GraphToEps<T> &hideNodes(bool b=true) {_showNodes=!b;return *this;}
384 
385  ///Sets the size of the node texts
386 
387  ///Sets the size of the node texts
388  ///
389  GraphToEps<T> &nodeTextSize(double d) {_nodeTextSize=d;return *this;}
390  ///Gives a preamble block for node Postscript block.
391 
392  ///Gives a preamble block for node Postscript block.
393  ///
394  ///\sa nodePsTexts()
395  GraphToEps<T> & nodePsTextsPreamble(const char *str) {
396    _nodePsTextsPreamble=s ;return *this;
397  }
398  ///Sets whether the the graph is undirected
399
400  ///Sets whether the the graph is undirected
401  ///
402  GraphToEps<T> &undir(bool b=true) {_undir=b;return *this;}
403  ///Sets whether the the graph is directed
404
405  ///Sets whether the the graph is directed.
406  ///Use it to show the undirected edges as a pair of directed ones.
407  GraphToEps<T> &bidir(bool b=true) {_undir=!b;return *this;}
408
409protected:
410  bool isInsideNode(xy<double> p, double r,int t)
411  {
412    switch(t) {
413    case CIRCLE:
414      return p.normSquare()<=r*r;
415    case SQUARE:
416      return p.x<=r&&p.x>=-r&&p.y<=r&&p.y>=-r;
417    case DIAMOND:
418      return p.x+p.y<=r && p.x-p.y<=r && -p.x+p.y<=r && -p.x-p.y<=r;
419    }
420    return false;
421  }
422
423public:
424  ~GraphToEps()
425  {
426    if(dontPrint) return;
427   
428    os << "%!PS-Adobe-2.0 EPSF-2.0\n";
429    //\todo: Chech whether the graph is empty.
430    BoundingBox<double> bb;
431    for(NodeIt n(g);n!=INVALID;++n) {
432      double ns=_nodeSizes[n]*_nodeScale;
433      xy<double> p(ns,ns);
434      bb+=p+_coords[n];
435      bb+=-p+_coords[n];
436      }
437    os << "%%BoundingBox: "
438         << bb.left()*  _scale-_xBorder << ' '
439         << bb.bottom()*_scale-_yBorder << ' '
440         << bb.right()* _scale+_xBorder << ' '
441         << bb.top()*   _scale+_yBorder << '\n';
442    //x1 y1 x2 y2 x3 y3 cr cg cb w
443    os << "/lb { setlinewidth setrgbcolor newpath moveto\n"
444       << "      4 2 roll 1 index 1 index curveto stroke } bind def\n";
445    os << "/l { setlinewidth setrgbcolor newpath moveto lineto stroke } bind def\n";
446    //x y r
447    os << "/c { newpath dup 3 index add 2 index moveto 0 360 arc closepath } bind def\n";
448    //x y r
449    os << "/sq { newpath 2 index 1 index add 2 index 2 index add moveto\n"
450       << "      2 index 1 index sub 2 index 2 index add lineto\n"
451       << "      2 index 1 index sub 2 index 2 index sub lineto\n"
452       << "      2 index 1 index add 2 index 2 index sub lineto\n"
453       << "      closepath pop pop pop} bind def\n";
454    //x y r
455    os << "/di { newpath 2 index 1 index add 2 index moveto\n"
456       << "      2 index             2 index 2 index add lineto\n"
457       << "      2 index 1 index sub 2 index             lineto\n"
458       << "      2 index             2 index 2 index sub lineto\n"
459       << "      closepath pop pop pop} bind def\n";
460    // x y r cr cg cb
461    os << "/nc { setrgbcolor 2 index 2 index 2 index c fill\n"
462       << "     0 0 0 setrgbcolor dup "
463       << _nodeBorderQuotient << " mul setlinewidth "
464       << 1+_nodeBorderQuotient/2 << " div c stroke\n"
465       << "   } bind def\n";
466    os << "/nsq { setrgbcolor 2 index 2 index 2 index sq fill\n"
467       << "     0 0 0 setrgbcolor dup "
468       << _nodeBorderQuotient << " mul setlinewidth "
469       << 1+_nodeBorderQuotient/2 << " div sq stroke\n"
470       << "   } bind def\n";
471    os << "/ndi { setrgbcolor 2 index 2 index 2 index di fill\n"
472       << "     0 0 0 setrgbcolor dup "
473       << _nodeBorderQuotient << " mul setlinewidth "
474       << 1+_nodeBorderQuotient/2 << " div di stroke\n"
475       << "   } bind def\n";
476    os << "/arrl " << _arrowLength << " def\n";
477    os << "/arrw " << _arrowWidth << " def\n";
478    // l dx_norm dy_norm
479    os << "/lrl { 2 index mul exch 2 index mul exch rlineto pop} bind def\n";
480    //len w dx_norm dy_norm x1 y1 cr cg cb
481    os << "/arr { setrgbcolor /y1 exch def /x1 exch def /dy exch def /dx exch def\n"
482       << "       /w exch def /len exch def\n"
483      //         << "       0.1 setlinewidth x1 y1 moveto dx len mul dy len mul rlineto stroke"
484       << "       newpath x1 dy w 2 div mul add y1 dx w 2 div mul sub moveto\n"
485       << "       len w sub arrl sub dx dy lrl\n"
486       << "       arrw dy dx neg lrl\n"
487       << "       dx arrl w add mul dy w 2 div arrw add mul sub\n"
488       << "       dy arrl w add mul dx w 2 div arrw add mul add rlineto\n"
489       << "       dx arrl w add mul neg dy w 2 div arrw add mul sub\n"
490       << "       dy arrl w add mul neg dx w 2 div arrw add mul add rlineto\n"
491       << "       arrw dy dx neg lrl\n"
492       << "       len w sub arrl sub neg dx dy lrl\n"
493       << "       closepath fill } bind def\n";
494    os << "/cshow { 2 index 2 index moveto dup stringwidth pop\n"
495       << "         neg 2 div fosi .35 mul neg rmoveto show pop pop} def\n";
496
497    os << "\ngsave\n";
498    if(_scale!=1.0) os << _scale << " dup scale\n";
499   
500    if(_showEdges) {
501      os << "%Edges:\ngsave\n";     
502      if(_enableParallel) {
503        std::vector<Edge> el;
504        for(EdgeIt e(g);e!=INVALID;++e)
505          if(!_undir||g.source(e)<g.target(e)) el.push_back(e);
506        sort(el.begin(),el.end(),edgeLess(g));
507       
508        typename std::vector<Edge>::iterator j;
509        for(typename std::vector<Edge>::iterator i=el.begin();i!=el.end();i=j) {
510          for(j=i+1;j!=el.end()&&isParallel(*i,*j);++j) ;
511
512          double sw=0;
513          for(typename std::vector<Edge>::iterator e=i;e!=j;++e)
514            sw+=_edgeWidths[*e]*_edgeWidthScale+_parEdgeDist;
515          sw-=_parEdgeDist;
516          sw/=-2.0;
517          xy<double> dvec(_coords[g.target(*i)]-_coords[g.source(*i)]);
518          double l=sqrt(dvec.normSquare());
519          xy<double> d(dvec/l);
520          xy<double> m;
521//        m=xy<double>(_coords[g.target(*i)]+_coords[g.source(*i)])/2.0;
522
523//        m=xy<double>(_coords[g.source(*i)])+
524//          dvec*(double(_nodeSizes[g.source(*i)])/
525//             (_nodeSizes[g.source(*i)]+_nodeSizes[g.target(*i)]));
526
527          m=xy<double>(_coords[g.source(*i)])+
528            d*(l+_nodeSizes[g.source(*i)]-_nodeSizes[g.target(*i)])/2.0;
529
530          for(typename std::vector<Edge>::iterator e=i;e!=j;++e) {
531            sw+=_edgeWidths[*e]*_edgeWidthScale/2.0;
532            xy<double> mm=m+rot(d)*sw/.75;
533            if(_drawArrows) {
534              int node_shape;
535              xy<double> s=_coords[g.source(*e)];
536              xy<double> t=_coords[g.target(*e)];
537              double rn=_nodeSizes[g.target(*e)]*_nodeScale;
538              node_shape=_nodeShapes[g.target(*e)];
539              Bezier3 bez(s,mm,mm,t);
540              double t1=0,t2=1;
541              for(int i=0;i<INTERPOL_PREC;++i)
542                if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t2=(t1+t2)/2;
543                else t1=(t1+t2)/2;
544              xy<double> apoint=bez((t1+t2)/2);
545              rn = _arrowLength+_edgeWidths[*e]*_edgeWidthScale;
546              rn*=rn;
547              t2=(t1+t2)/2;t1=0;
548              for(int i=0;i<INTERPOL_PREC;++i)
549                if((bez((t1+t2)/2)-apoint).normSquare()>rn) t1=(t1+t2)/2;
550                else t2=(t1+t2)/2;
551              xy<double> linend=bez((t1+t2)/2);       
552              bez=bez.before((t1+t2)/2);
553//            rn=_nodeSizes[g.source(*e)]*_nodeScale;
554//            node_shape=_nodeShapes[g.source(*e)];
555//            t1=0;t2=1;
556//            for(int i=0;i<INTERPOL_PREC;++i)
557//              if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t1=(t1+t2)/2;
558//              else t2=(t1+t2)/2;
559//            bez=bez.after((t1+t2)/2);
560              os << _edgeWidths[*e]*_edgeWidthScale << " setlinewidth "
561                 << _edgeColors[*e].getR() << ' '
562                 << _edgeColors[*e].getG() << ' '
563                 << _edgeColors[*e].getB() << " setrgbcolor newpath\n"
564                 << bez.p1.x << ' ' <<  bez.p1.y << " moveto\n"
565                 << bez.p2.x << ' ' << bez.p2.y << ' '
566                 << bez.p3.x << ' ' << bez.p3.y << ' '
567                 << bez.p4.x << ' ' << bez.p4.y << " curveto stroke\n";
568              xy<double> dd(rot(linend-apoint));
569              dd*=(_edgeWidths[*e]*_edgeWidthScale+_arrowWidth)/
570                sqrt(dd.normSquare());
571              os << "newpath " << psOut(apoint) << " moveto "
572                 << psOut(linend+dd) << " lineto "
573                 << psOut(linend-dd) << " lineto closepath fill\n";
574            }
575            else {
576              os << _coords[g.source(*e)].x << ' '
577                 << _coords[g.source(*e)].y << ' '
578                 << mm.x << ' ' << mm.y << ' '
579                 << _coords[g.target(*e)].x << ' '
580                 << _coords[g.target(*e)].y << ' '
581                 << _edgeColors[*e].getR() << ' '
582                 << _edgeColors[*e].getG() << ' '
583                 << _edgeColors[*e].getB() << ' '
584                 << _edgeWidths[*e]*_edgeWidthScale << " lb\n";
585            }
586            sw+=_edgeWidths[*e]*_edgeWidthScale/2.0+_parEdgeDist;
587          }
588        }
589      }
590      else for(EdgeIt e(g);e!=INVALID;++e)
591        if(!_undir||g.source(e)<g.target(e))
592          if(_drawArrows) {
593            xy<double> d(_coords[g.target(e)]-_coords[g.source(e)]);
594            double rn=_nodeSizes[g.target(e)]*_nodeScale;
595            int node_shape=_nodeShapes[g.target(e)];
596            double t1=0,t2=1;
597            for(int i=0;i<INTERPOL_PREC;++i)
598              if(isInsideNode((-(t1+t2)/2)*d,rn,node_shape)) t1=(t1+t2)/2;
599              else t2=(t1+t2)/2;
600            double l=sqrt(d.normSquare());
601            d/=l;
602           
603            os << l*(1-(t1+t2)/2) << ' '
604               << _edgeWidths[e]*_edgeWidthScale << ' '
605               << d.x << ' ' << d.y << ' '
606               << _coords[g.source(e)].x << ' '
607               << _coords[g.source(e)].y << ' '
608               << _edgeColors[e].getR() << ' '
609               << _edgeColors[e].getG() << ' '
610               << _edgeColors[e].getB() << " arr\n";
611          }
612          else os << _coords[g.source(e)].x << ' '
613                  << _coords[g.source(e)].y << ' '
614                  << _coords[g.target(e)].x << ' '
615                  << _coords[g.target(e)].y << ' '
616                  << _edgeColors[e].getR() << ' '
617                  << _edgeColors[e].getG() << ' '
618                  << _edgeColors[e].getB() << ' '
619                  << _edgeWidths[e]*_edgeWidthScale << " l\n";
620      os << "grestore\n";
621    }
622    if(_showNodes) {
623      os << "%Nodes:\ngsave\n";
624      for(NodeIt n(g);n!=INVALID;++n) {
625        os << _coords[n].x << ' ' << _coords[n].y << ' '
626           << _nodeSizes[n]*_nodeScale << ' '
627           << _nodeColors[n].getR() << ' '
628           << _nodeColors[n].getG() << ' '
629           << _nodeColors[n].getB() << ' ';
630        switch(_nodeShapes[n]) {
631        case CIRCLE:
632          os<< "nc";break;
633        case SQUARE:
634          os<< "nsq";break;
635        case DIAMOND:
636          os<< "ndi";break;
637        }
638        os<<'\n';
639      }
640      os << "grestore\n";
641    }
642    if(_showNodeText) {
643      os << "%Node texts:\ngsave\n";
644      os << "/fosi " << _nodeTextSize << " def\n";
645      os << "(Helvetica) findfont fosi scalefont setfont\n";
646      os << "0 0 0 setrgbcolor\n";
647      for(NodeIt n(g);n!=INVALID;++n)
648        os << _coords[n].x << ' ' << _coords[n].y
649           << " (" << _nodeTexts[n] << ") cshow\n";
650      os << "grestore\n";
651    }
652    if(_showNodePsText) {
653      os << "%Node PS blocks:\ngsave\n";
654      for(NodeIt n(g);n!=INVALID;++n)
655        os << _coords[n].x << ' ' << _coords[n].y
656           << " moveto\n" << _nodePsTexts[n] << "\n";
657      os << "grestore\n";
658    }
659   
660    os << "grestore\n";
661
662    //CleanUp:
663    if(_pleaseRemoveOsStream) {delete &os;}
664  }
665};
666
667
668///Generates an EPS file from a graph
669
670///\ingroup misc
671///Generates an EPS file from a graph.
672///\param g is a reference to the graph to be printed
673///\param os is a reference to the output stream.
674///By default it is <tt>std::cout</tt>
675///
676///This function also has a lot of \ref named-templ-param "named parameters",
677///they are declared as the members of class \ref GraphToEps. The following
678///example shows how to use these parameters.
679///\code
680/// graphToEps(g).scale(10).coords(coords)
681///              .nodeScale(2).nodeSizes(sizes)
682///              .edgeWidthScale(.4);
683///\endcode
684///\sa GraphToEps
685///\sa graphToEps(G &g, char *file_name)
686template<class G>
687GraphToEps<DefaultGraphToEpsTraits<G> >
688graphToEps(G &g, std::ostream& os=std::cout)
689{
690  return
691    GraphToEps<DefaultGraphToEpsTraits<G> >(DefaultGraphToEpsTraits<G>(g,os));
692}
693 
694///Generates an EPS file from a graph
695
696//\ingroup misc
697///This function does the same as
698///\ref graphToEps(G &g,std::ostream& os)
699///but it writes its output into the file \c file_name
700///instead of a stream.
701///\sa graphToEps(G &g, std::ostream& os)
702template<class G>
703GraphToEps<DefaultGraphToEpsTraits<G> >
704graphToEps(G &g,char *file_name)
705{
706  return GraphToEps<DefaultGraphToEpsTraits<G> >
707    (DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name),true));
708}
709
710} //END OF NAMESPACE LEMON
711
712#endif // LEMON_GRAPH_TO_EPS_H
Note: See TracBrowser for help on using the repository browser.