COIN-OR::LEMON - Graph Library

source: lemon-0.x/demo/graph_to_eps_demo.cc @ 1930:92b70deed0c5

Last change on this file since 1930:92b70deed0c5 was 1930:92b70deed0c5, checked in by Alpar Juttner, 14 years ago

Solve bug #23: Floating versus Integer Coordinates

  • BoundingBox? values rounds to integer
  • The generated .eps rescales if the bounding box were too small otherwise.
File size: 6.2 KB
RevLine 
[1073]1/* -*- C++ -*-
[1435]2 * demo/graph_to_eps.cc - Part of LEMON, a generic C++ optimization library
[1073]3 *
[1875]4 * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
[1359]5 * (Egervary Research Group on Combinatorial Optimization, EGRES).
[1073]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
[1573]17/// \ingroup demos
18/// \file
19/// \brief Demo of the graph grawing function \ref graphToEps()
20///
21/// This demo program shows examples how to  use the function \ref
22/// graphToEps(). It takes no input but simply creates  six
[1587]23/// <tt>.eps</tt> files demonstrating the capability of \ref
24/// graphToEps(), and showing how to draw directed/undirected graphs,
25/// how to handle parallel egdes, how to change the properties (like
26/// color, shape, size, title etc.) of nodes and edges individually
[1630]27/// using appropriate \ref maps-page "graph maps".
[1641]28///
29/// \include graph_to_eps_demo.cc
[1073]30
[1417]31#include <cmath>
32
[1573]33#include<lemon/graph_to_eps.h>
34#include<lemon/list_graph.h>
[1802]35#include<lemon/graph_utils.h>
[1073]36
37using namespace std;
38using namespace lemon;
39
40int main()
41{
[1178]42  ColorSet colorSet;
43
[1073]44  ListGraph g;
45  typedef ListGraph::Node Node;
46  typedef ListGraph::NodeIt NodeIt;
47  typedef ListGraph::Edge Edge;
48  typedef xy<int> Xy;
49 
50  Node n1=g.addNode();
51  Node n2=g.addNode();
52  Node n3=g.addNode();
53  Node n4=g.addNode();
54  Node n5=g.addNode();
55
56  ListGraph::NodeMap<Xy> coords(g);
57  ListGraph::NodeMap<double> sizes(g);
58  ListGraph::NodeMap<int> colors(g);
[1086]59  ListGraph::NodeMap<int> shapes(g);
[1073]60  ListGraph::EdgeMap<int> ecolors(g);
61  ListGraph::EdgeMap<int> widths(g);
62 
[1086]63  coords[n1]=Xy(50,50);  sizes[n1]=1; colors[n1]=1; shapes[n1]=0;
[1088]64  coords[n2]=Xy(50,70);  sizes[n2]=2; colors[n2]=2; shapes[n2]=2;
[1086]65  coords[n3]=Xy(70,70);  sizes[n3]=1; colors[n3]=3; shapes[n3]=0;
66  coords[n4]=Xy(70,50);  sizes[n4]=2; colors[n4]=4; shapes[n4]=1;
[1088]67  coords[n5]=Xy(85,60);  sizes[n5]=3; colors[n5]=5; shapes[n5]=2;
[1073]68 
69  Edge e;
70
71  e=g.addEdge(n1,n2); ecolors[e]=0; widths[e]=1;
72  e=g.addEdge(n2,n3); ecolors[e]=0; widths[e]=1;
73  e=g.addEdge(n3,n5); ecolors[e]=0; widths[e]=3;
74  e=g.addEdge(n5,n4); ecolors[e]=0; widths[e]=1;
75  e=g.addEdge(n4,n1); ecolors[e]=0; widths[e]=1;
76  e=g.addEdge(n2,n4); ecolors[e]=1; widths[e]=2;
77  e=g.addEdge(n3,n4); ecolors[e]=2; widths[e]=1;
78 
[1268]79  IdMap<ListGraph,Node> id(g);
[1073]80
[1573]81  cout << "Create 'graph_to_eps_demo_out.eps'" << endl;
[1930]82  graphToEps(g,"graph_to_eps_demo_out.eps").
83    //scale(10).
84    coords(coords).
[1108]85    title("Sample .eps figure").
[1875]86    copyright("(C) 2006 LEMON Project").
[1073]87    nodeScale(2).nodeSizes(sizes).
[1086]88    nodeShapes(shapes).
[1073]89    nodeColors(composeMap(colorSet,colors)).
90    edgeColors(composeMap(colorSet,ecolors)).
91    edgeWidthScale(.4).edgeWidths(widths).
[1091]92    nodeTexts(id).nodeTextSize(3).
93    run();
[1073]94
[1573]95
96  cout << "Create 'graph_to_eps_demo_out_arr.eps'" << endl;
[1930]97  graphToEps(g,"graph_to_eps_demo_out_arr.eps").
98    //scale(10).
[1108]99    title("Sample .eps figure (with arrowheads)").
[1875]100    copyright("(C) 2006 LEMON Project").
[1091]101    nodeColors(composeMap(colorSet,colors)).
102    coords(coords).
[1073]103    nodeScale(2).nodeSizes(sizes).
[1086]104    nodeShapes(shapes).
[1073]105    edgeColors(composeMap(colorSet,ecolors)).
106    edgeWidthScale(.4).edgeWidths(widths).
107    nodeTexts(id).nodeTextSize(3).
[1091]108    drawArrows().arrowWidth(1).arrowLength(1).
109    run();
[1073]110
111  e=g.addEdge(n1,n4); ecolors[e]=2; widths[e]=1;
112  e=g.addEdge(n4,n1); ecolors[e]=1; widths[e]=2;
113
114  e=g.addEdge(n1,n2); ecolors[e]=1; widths[e]=1;
115  e=g.addEdge(n1,n2); ecolors[e]=2; widths[e]=1;
116  e=g.addEdge(n1,n2); ecolors[e]=3; widths[e]=1;
117  e=g.addEdge(n1,n2); ecolors[e]=4; widths[e]=1;
118  e=g.addEdge(n1,n2); ecolors[e]=5; widths[e]=1;
119  e=g.addEdge(n1,n2); ecolors[e]=6; widths[e]=1;
120  e=g.addEdge(n1,n2); ecolors[e]=7; widths[e]=1;
121
[1573]122  cout << "Create 'graph_to_eps_demo_out_par.eps'" << endl;
[1930]123  graphToEps(g,"graph_to_eps_demo_out_par.eps").
124    //scale(10).
[1108]125    title("Sample .eps figure (parallel edges)").
[1875]126    copyright("(C) 2006 LEMON Project").
[1091]127    nodeShapes(shapes).
128    coords(coords).
[1073]129    nodeScale(2).nodeSizes(sizes).
130    nodeColors(composeMap(colorSet,colors)).
131    edgeColors(composeMap(colorSet,ecolors)).
132    edgeWidthScale(.4).edgeWidths(widths).
133    nodeTexts(id).nodeTextSize(3).
[1091]134    enableParallel().parEdgeDist(1.5).
135    run();
136 
[1573]137  cout << "Create 'graph_to_eps_demo_out_par_arr.eps'" << endl;
[1930]138  graphToEps(g,"graph_to_eps_demo_out_par_arr.eps").
139    //scale(10).
[1108]140    title("Sample .eps figure (parallel edges and arrowheads)").
[1875]141    copyright("(C) 2006 LEMON Project").
[1073]142    nodeScale(2).nodeSizes(sizes).
[1091]143    coords(coords).
[1086]144    nodeShapes(shapes).
[1073]145    nodeColors(composeMap(colorSet,colors)).
146    edgeColors(composeMap(colorSet,ecolors)).
147    edgeWidthScale(.3).edgeWidths(widths).
148    nodeTexts(id).nodeTextSize(3).
149    enableParallel().parEdgeDist(1).
[1091]150    drawArrows().arrowWidth(1).arrowLength(1).
[1103]151    run();
152
[1573]153  cout << "Create 'graph_to_eps_demo_out_a4.eps'" << endl;
[1103]154  graphToEps(g,"graph_to_eps_demo_out_a4.eps").scaleToA4().
[1108]155    title("Sample .eps figure (fits to A4)").
[1875]156    copyright("(C) 2006 LEMON Project").
[1103]157    nodeScale(2).nodeSizes(sizes).
158    coords(coords).
159    nodeShapes(shapes).
160    nodeColors(composeMap(colorSet,colors)).
161    edgeColors(composeMap(colorSet,ecolors)).
162    edgeWidthScale(.3).edgeWidths(widths).
163    nodeTexts(id).nodeTextSize(3).
164    enableParallel().parEdgeDist(1).
165    drawArrows().arrowWidth(1).arrowLength(1).
166    run();
167
[1178]168  ListGraph h;
169  ListGraph::NodeMap<int> hcolors(h);
170  ListGraph::NodeMap<Xy> hcoords(h);
171 
172  int cols=int(sqrt(double(colorSet.size())));
173  for(int i=0;i<int(colorSet.size());i++) {
174    Node n=h.addNode();
175    hcoords[n]=Xy(i%cols,i/cols);
176    hcolors[n]=i;
177  }
178 
[1573]179  cout << "Create 'graph_to_eps_demo_out_colors.eps'" << endl;
[1930]180  graphToEps(h,"graph_to_eps_demo_out_colors.eps").
181    //scale(60).
[1573]182    title("Sample .eps figure (ColorSet demo)").
[1875]183    copyright("(C) 2006 LEMON Project").
[1178]184    coords(hcoords).
185    nodeScale(.45).
186    distantColorNodeTexts().
187    //    distantBWNodeTexts().
188    nodeTexts(hcolors).nodeTextSize(.6).
189    nodeColors(composeMap(colorSet,hcolors)).
190    run();
191
192
[1073]193}
Note: See TracBrowser for help on using the repository browser.