Major improvements in NetworkSimplex.
Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2008
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";
43 GraphReader<SmartGraph> reader(filename,graph);
44 SmartGraph::EdgeMap<int> cap(graph);
45 reader.readEdgeMap("capacity",cap);
46 reader.readAttribute("name",name);
49 std::cout << "Hello! We have read a graph from file " << filename<<
50 " and some maps on it:\n now we write it to the standard output!" <<
54 GraphWriter<SmartGraph> writer(std::cout, graph);
55 writer.writeEdgeMap("multiplicity", cap);
56 writer.writeAttribute("name",name);
59 } catch (DataFormatError& error) {
60 std::cerr << error.what() << std::endl;