Changeset 209:765619b7cbb2 in lemon for demo

Timestamp:

07/13/08 20:51:02 (16 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Phase:

public

Message:

Apply unify-sources.sh to the source tree

Location:

demo

Files:

• arg_parser_demo.cc (modified) (4 diffs)
• graph_to_eps_demo.cc (modified) (8 diffs)
• lgf_demo.cc (modified) (3 diffs)

demo/arg_parser_demo.cc

@@ -1 @@
-/* -*- 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
@@ -65 +65 @@
   ap.other("infile", "The input file.")
     .other("...");
-  
+
   // Perform the parsing process
   // (in case of any error it terminates the program)
@@ -85 +85 @@
   if(ap.given("grb")) std::cout << "  -grb is given\n";
   if(ap.given("grc")) std::cout << "  -grc is given\n";
-  
+
   switch(ap.files().size()) {
   case 0:
@@ -95 +95 @@
   default:
     std::cout << "  "
-              << ap.files().size() << " file arguments were given. They are:\n";
+              << ap.files().size() << " file arguments were given. They are:\n";
   }
   for(unsigned int i=0;i<ap.files().size();++i)
     std::cout << "    '" << ap.files()[i] << "'\n";
-  
+
   return 0;
 }

demo/graph_to_eps_demo.cc

@@ -1 @@
-/* -*- C++ -*-
- *
- * This file is a part of LEMON, a generic C++ optimization library
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
+ *
+ * This file is a part of LEMON, a generic C++ optimization library.
  *
  * Copyright (C) 2003-2008
@@ -50 +50 @@
   typedef ListDigraph::Arc Arc;
   typedef dim2::Point<int> Point;
-  
+
   Node n1=g.addNode();
   Node n2=g.addNode();
@@ -63 +63 @@
   ListDigraph::ArcMap<int> acolors(g);
   ListDigraph::ArcMap<int> 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;
@@ -69 +69 @@
   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;
 
@@ -79 +79 @@
   a=g.addArc(n2,n4); acolors[a]=1; widths[a]=2;
   a=g.addArc(n3,n4); acolors[a]=2; widths[a]=1;
-  
+
   IdMap<ListDigraph,Node> id(g);
 
@@ -183 +183 @@
   ListDigraph::NodeMap<int> hcolors(h);
   ListDigraph::NodeMap<Point> hcoords(h);
-  
+
   int cols=int(sqrt(double(palette.size())));
   for(int i=0;i<int(paletteW.size());i++) {
@@ -190 +190 @@
     hcolors[n]=i;
   }
-  
+
   cout << "Create 'graph_to_eps_demo_out_6_colors.eps'" << endl;
   graphToEps(h,"graph_to_eps_demo_out_6_colors.eps").
@@ -203 +203 @@
     nodeColors(composeMap(paletteW,hcolors)).
     run();
-    
+
   return 0;
 }

demo/lgf_demo.cc

@@ -1 @@
-/* -*- 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
@@ -22 +22 @@
 ///
 /// This program gives an example of how to read and write a digraph
-/// and additional maps from/to a stream or a file using the 
+/// and additional maps from/to a stream or a file using the
 /// \ref lgf-format "LGF" format.
 ///
@@ -43 +43 @@
   SmartDigraph::ArcMap<int> cap(g);
   SmartDigraph::Node s, t;
-  
+
   try {
     digraphReader("digraph.lgf", g). // read the directed graph into g