3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
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.
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
21 ///\brief Demonstrating graph input and output
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
27 /// \include reader_writer_demo.cc
30 #include <lemon/smart_graph.h>
31 #include <lemon/graph_reader.h>
32 #include <lemon/graph_writer.h>
35 using namespace lemon;
41 std::string filename="sample.lgf";
42 GraphReader<SmartGraph> reader(filename,graph);
43 SmartGraph::EdgeMap<int> cap(graph);
44 reader.readEdgeMap("capacity",cap);
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!" <<
52 GraphWriter<SmartGraph> writer(std::cout, graph);
53 writer.writeEdgeMap("multiplicity", cap);
56 } catch (DataFormatError& error) {
57 std::cerr << error.what() << std::endl;