1.1 --- a/demo/descriptor_map_demo.cc	Wed Jul 13 14:05:49 2005 +0000
     1.2 +++ b/demo/descriptor_map_demo.cc	Wed Jul 13 14:17:13 2005 +0000
     1.3 @@ -1,8 +1,26 @@
     1.4 +/* -*- C++ -*-
     1.5 + * demo/descriptor_map_demo.cc - Part of LEMON, a generic C++ optimization library
     1.6 + *
     1.7 + * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     1.8 + * (Egervary Research Group on Combinatorial Optimization, EGRES).
     1.9 + *
    1.10 + * Permission to use, modify and distribute this software is granted
    1.11 + * provided that this copyright notice appears in all copies. For
    1.12 + * precise terms see the accompanying LICENSE file.
    1.13 + *
    1.14 + * This software is provided "AS IS" with no warranty of any kind,
    1.15 + * express or implied, and with no claim as to its suitability for any
    1.16 + * purpose.
    1.17 + *
    1.18 + */
    1.19 +
    1.20  #include <lemon/list_graph.h>
    1.21  #include <lemon/graph_utils.h>
    1.22 +#include <lemon/graph_writer.h>
    1.23  #include <lemon/xy.h>
    1.24 +#include <lemon/graph_to_eps.h>
    1.25  
    1.26 -#include <lemon/graph_to_eps.h>
    1.27 +#include <iostream>
    1.28  
    1.29  #include <cstdlib>
    1.30  #include <cmath>
    1.31 @@ -50,7 +68,9 @@
    1.32    typedef Graph::Edge Edge;
    1.33    
    1.34    // Generating a graph
    1.35 -  
    1.36 +
    1.37 +  std::cout << "Generating graph: " << std::endl;
    1.38 +
    1.39    Graph graph;
    1.40    
    1.41    const int NODE = 16;
    1.42 @@ -78,6 +98,11 @@
    1.43      graph.addEdge(nodeInv[si], nodeInv[ti]);
    1.44    }
    1.45  
    1.46 +  GraphWriter<Graph>(std::cout, graph).run();
    1.47 +
    1.48 +  std::cout << std::endl;
    1.49 +  std::cout << "Postscript file: descriptor_map_demo.eps" << std::endl;
    1.50 +
    1.51    // Make postscript from the graph.
    1.52      
    1.53    CircleMap<Graph> coords(graph, xy<double>(0.0, 0.0), 10.0);