demo/reader_writer_demo.cc
author deba
Fri, 14 Apr 2006 18:05:02 +0000
changeset 2050 d9a221218ea4
parent 1875 98698b69a902
child 2391 14a343be7a5a
permissions -rw-r--r--
Changing the mining of the clear in heaps
It does not touch the heap cross ref. It is
sometimes more clean useable and more efficient
     1 /* -*- C++ -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library
     4  *
     5  * Copyright (C) 2003-2006
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 
    19 ///\ingroup demos
    20 ///\file
    21 ///\brief Demonstrating graph input and output
    22 ///
    23 /// This simple demo program gives an example of how to read and write
    24 /// a graph and additional maps (on the nodes or the edges) from/to a
    25 /// stream. 
    26 ///
    27 /// \include reader_writer_demo.cc
    28 
    29 #include <iostream>
    30 #include <lemon/smart_graph.h>
    31 #include <lemon/graph_reader.h>
    32 #include <lemon/graph_writer.h>
    33 
    34 
    35 using namespace lemon;
    36 
    37 int main() {
    38   SmartGraph graph;
    39 
    40   try {
    41     std::string filename="sample.lgf";
    42     GraphReader<SmartGraph> reader(filename,graph);
    43     SmartGraph::EdgeMap<int> cap(graph);
    44     reader.readEdgeMap("capacity",cap);
    45     reader.run();
    46 
    47     std::cout << "Hello! We have read a graph from file " << filename<< 
    48       " and some maps on it:\n now we write it to the standard output!" << 
    49       std::endl;
    50 
    51 
    52     GraphWriter<SmartGraph> writer(std::cout, graph);
    53     writer.writeEdgeMap("multiplicity", cap);
    54     writer.run();
    55      
    56   } catch (DataFormatError& error) {
    57     std::cerr << error.what() << std::endl;
    58   }
    59 
    60 
    61   return 0;
    62 }