diff -r 4317d277ba21 -r 765619b7cbb2 demo/graph_to_eps_demo.cc --- a/demo/graph_to_eps_demo.cc Sun Jul 13 16:46:56 2008 +0100 +++ b/demo/graph_to_eps_demo.cc Sun Jul 13 19:51:02 2008 +0100 @@ -1,6 +1,6 @@ -/* -*- C++ -*- +/* -*- mode: C++; indent-tabs-mode: nil; -*- * - * This file is a part of LEMON, a generic C++ optimization library + * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2008 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport @@ -49,7 +49,7 @@ typedef ListDigraph::NodeIt NodeIt; typedef ListDigraph::Arc Arc; typedef dim2::Point Point; - + Node n1=g.addNode(); Node n2=g.addNode(); Node n3=g.addNode(); @@ -62,13 +62,13 @@ ListDigraph::NodeMap shapes(g); ListDigraph::ArcMap acolors(g); ListDigraph::ArcMap widths(g); - + coords[n1]=Point(50,50); sizes[n1]=1; colors[n1]=1; shapes[n1]=0; coords[n2]=Point(50,70); sizes[n2]=2; colors[n2]=2; shapes[n2]=2; coords[n3]=Point(70,70); sizes[n3]=1; colors[n3]=3; shapes[n3]=0; coords[n4]=Point(70,50); sizes[n4]=2; colors[n4]=4; shapes[n4]=1; coords[n5]=Point(85,60); sizes[n5]=3; colors[n5]=5; shapes[n5]=2; - + Arc a; a=g.addArc(n1,n2); acolors[a]=0; widths[a]=1; @@ -78,7 +78,7 @@ a=g.addArc(n4,n1); acolors[a]=0; widths[a]=1; a=g.addArc(n2,n4); acolors[a]=1; widths[a]=2; a=g.addArc(n3,n4); acolors[a]=2; widths[a]=1; - + IdMap id(g); // Create five .eps files showing the digraph with different options @@ -182,14 +182,14 @@ ListDigraph h; ListDigraph::NodeMap hcolors(h); ListDigraph::NodeMap hcoords(h); - + int cols=int(sqrt(double(palette.size()))); for(int i=0;i