# HG changeset patch
# User deba
# Date 1121264233 0
# Node ID 572bc7d0d3e27234336914c42446d552da2e6bb9
# Parent  434f9add42cdc0909409b6f4e8f4781a16467468
Demo displays information on the screen
Added to Makefile.am

diff -r 434f9add42cd -r 572bc7d0d3e2 demo/Makefile.am
--- a/demo/Makefile.am	Wed Jul 13 14:05:49 2005 +0000
+++ b/demo/Makefile.am	Wed Jul 13 14:17:13 2005 +0000
@@ -12,6 +12,7 @@
 	min_route \
 	hello_lemon \
 	sub_graph_adaptor_demo \
+	descriptor_map_demo \
 	coloring
 
 if HAVE_GLPK
@@ -48,3 +49,5 @@
 
 lp_maxflow_demo_SOURCES = lp_maxflow_demo.cc
 lp_maxflow_demo_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)
+
+descriptor_map_demo_SOURCES = descriptor_map_demo.cc
\ No newline at end of file
diff -r 434f9add42cd -r 572bc7d0d3e2 demo/descriptor_map_demo.cc
--- a/demo/descriptor_map_demo.cc	Wed Jul 13 14:05:49 2005 +0000
+++ b/demo/descriptor_map_demo.cc	Wed Jul 13 14:17:13 2005 +0000
@@ -1,8 +1,26 @@
+/* -*- C++ -*-
+ * demo/descriptor_map_demo.cc - Part of LEMON, a generic C++ optimization library
+ *
+ * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
+ * (Egervary Research Group on Combinatorial Optimization, EGRES).
+ *
+ * Permission to use, modify and distribute this software is granted
+ * provided that this copyright notice appears in all copies. For
+ * precise terms see the accompanying LICENSE file.
+ *
+ * This software is provided "AS IS" with no warranty of any kind,
+ * express or implied, and with no claim as to its suitability for any
+ * purpose.
+ *
+ */
+
 #include <lemon/list_graph.h>
 #include <lemon/graph_utils.h>
+#include <lemon/graph_writer.h>
 #include <lemon/xy.h>
+#include <lemon/graph_to_eps.h>
 
-#include <lemon/graph_to_eps.h>
+#include <iostream>
 
 #include <cstdlib>
 #include <cmath>
@@ -50,7 +68,9 @@
   typedef Graph::Edge Edge;
   
   // Generating a graph
-  
+
+  std::cout << "Generating graph: " << std::endl;
+
   Graph graph;
   
   const int NODE = 16;
@@ -78,6 +98,11 @@
     graph.addEdge(nodeInv[si], nodeInv[ti]);
   }
 
+  GraphWriter<Graph>(std::cout, graph).run();
+
+  std::cout << std::endl;
+  std::cout << "Postscript file: descriptor_map_demo.eps" << std::endl;
+
   // Make postscript from the graph.
     
   CircleMap<Graph> coords(graph, xy<double>(0.0, 0.0), 10.0);