Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.
2 * demo/reader_writer_demo.cc - Part of LEMON, a generic C++ optimization
5 * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
6 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8 * Permission to use, modify and distribute this software is granted
9 * provided that this copyright notice appears in all copies. For
10 * precise terms see the accompanying LICENSE file.
12 * This software is provided "AS IS" with no warranty of any kind,
13 * express or implied, and with no claim as to its suitability for any
20 ///\brief Demonstrating graph input and output
22 /// This simple demo program gives an example of how to read and write
23 /// a graph and additional maps (on the nodes or the edges) from/to a
26 /// \include reader_writer_demo.cc
29 #include <lemon/smart_graph.h>
30 #include <lemon/graph_reader.h>
31 #include <lemon/graph_writer.h>
34 using namespace lemon;
40 std::string filename="sample.lgf";
41 GraphReader<SmartGraph> reader(filename,graph);
42 SmartGraph::EdgeMap<int> cap(graph);
43 reader.readEdgeMap("capacity",cap);
46 std::cout << "Hello! We have read a graph from file " << filename<<
47 " and some maps on it:\n now we write it to the standard output!" <<
51 GraphWriter<SmartGraph> writer(std::cout, graph);
52 writer.writeEdgeMap("multiplicity", cap);
55 } catch (DataFormatError& error) {
56 std::cerr << error.what() << std::endl;