alpar@2391: /* -*- C++ -*-
alpar@2391: *
alpar@2391: * This file is a part of LEMON, a generic C++ optimization library
alpar@2391: *
alpar@2553: * Copyright (C) 2003-2008
alpar@2391: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@2391: * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@2391: *
alpar@2391: * Permission to use, modify and distribute this software is granted
alpar@2391: * provided that this copyright notice appears in all copies. For
alpar@2391: * precise terms see the accompanying LICENSE file.
alpar@2391: *
alpar@2391: * This software is provided "AS IS" with no warranty of any kind,
alpar@2391: * express or implied, and with no claim as to its suitability for any
alpar@2391: * purpose.
alpar@2391: *
alpar@2391: */
alpar@2391:
athos@1169: /**
athos@1169:
alpar@1170: \page quicktour Quick Tour to LEMON
alpar@1170:
athos@1580: Let us first answer the question "What do I want to use LEMON for?".
athos@1175: LEMON is a C++ library, so you can use it if you want to write C++
athos@1175: programs. What kind of tasks does the library LEMON help to solve?
athos@1175: It helps to write programs that solve optimization problems that arise
athos@1175: frequently when designing and testing certain networks, for example
athos@1175: in telecommunication, computer networks, and other areas that I cannot
athos@1175: think of now. A very natural way of modelling these networks is by means
athos@1183: of a graph (we will always mean a directed graph by that and say
athos@1183: undirected graph otherwise).
athos@1175: So if you want to write a program that works with
athos@1183: graphs then you might find it useful to use our library LEMON. LEMON
athos@1183: defines various graph concepts depending on what you want to do with the
athos@1183: graph: a very good description can be found in the page
athos@1183: about \ref graphs "graphs".
athos@1175:
athos@1514: You will also want to assign data to the edges or nodes of the graph, for
athos@1514: example a length or capacity function defined on the edges. You can do this in
athos@1514: LEMON using so called \b maps. You can define a map on the nodes or on the edges of the graph and the value of the map (the range of the function) can be practically almost of any type. Read more about maps \ref maps-page "here".
athos@1175:
athos@1528: In this quick tour we want to show you some facilities LEMON library can provide through examples (simple demo programs). The examples will only show part of the functionality, but links will always be given to reach complete details.
athos@1528: You will find links next to the code fragments that help to download full demo programs: save them on your computer and compile them according to the description in the page about \ref getstart "How to start using LEMON".
athos@1528:
athos@1528: Have fun!
athos@1175:
athos@1522: - The first thing to discuss is the way one can create data structures
athos@1522: like graphs and maps in a program using LEMON.
athos@1522: //There are more graph types
athos@1522: //implemented in LEMON and you can implement your own graph type just as well:
athos@1522: //read more about this in the already mentioned page on \ref graphs "graphs".
athos@1522:
athos@1522: First we show how to add nodes and edges to a graph manually. We will also
athos@1522: define a map on the edges of the graph. After this we show the way one can
athos@1522: read a graph (and perhaps maps on it) from a stream (e.g. a file). Of course
athos@1522: we also have routines that write a graph (and perhaps maps) to a stream
athos@1522: (file): this will also be shown. LEMON supports the DIMACS file formats to
athos@1534: read network optimization problems, but more importantly we also have our own
athos@1522: file format that gives a more flexible way to store data related to network
athos@1522: optimization.
athos@1522:
athos@1530:
- The following code shows how to build a graph from scratch
athos@1530: and iterate on its nodes and edges. This example also shows how to
athos@1530: give a map on the edges of the graph. The type Listgraph is one of
athos@1530: the LEMON graph types: the typedefs in the beginning are for
athos@1530: convenience and we will assume them later as well.
athos@1522:
alpar@1640: \dontinclude hello_lemon.cc
alpar@1640: \skip include
alpar@1640: \until }
athos@1522:
athos@1530: See the whole program in file \ref hello_lemon.cc in the \c demo subdir of
athos@1526: LEMON package.
athos@1175:
athos@1526: If you want to read more on the LEMON graph structures and
athos@1526: concepts, read the page about \ref graphs "graphs".
athos@1522:
athos@1530:
athos@1530:
- LEMON has an own file format for storing graphs, maps on edges/nodes and some other things. Instead of any explanation let us give a
athos@1530: short example file in this format: read the detailed description of the LEMON
athos@1530: graph file format and input-output routines here: \ref graph-io-page.
athos@1530:
athos@1530: So here is a file describing a graph of 6 nodes (0 to 5), two nodemaps
athos@1530: (called \c coordinates_x and \c coordinates_y), several edges, an edge map
athos@1530: called \c capacity and two designated nodes (called \c source and \c target).
athos@1530:
athos@1541: \verbatim
athos@1541: @nodeset
athos@1541: id coordinates_x coordinates_y
athos@1541: 5 796.398 208.035
athos@1541: 4 573.002 63.002
athos@1541: 3 568.549 401.748
athos@1541: 2 277.889 68.476
athos@1541: 1 288.248 397.327
athos@1541: 0 102.239 257.532
athos@1541: @edgeset
athos@1541: id capacity
athos@1541: 4 5 6 8
athos@1541: 3 5 5 8
athos@1541: 2 4 4 5
athos@1541: 1 4 3 8
athos@1541: 1 3 2 5
athos@1541: 0 2 1 10
athos@1541: 0 1 0 10
athos@1541: #This is a comment here
athos@1541: @nodes
athos@1541: source 0
athos@1541: target 5
athos@1541: @edges
athos@1541: @attributes
athos@1541: author "Attila BERNATH"
athos@1541: @end
athos@1541: \endverbatim
athos@1530:
athos@1530: Finally let us give a simple example that reads a graph from a file and writes
athos@1530: it to the standard output.
athos@1530:
alpar@1640: \dontinclude reader_writer_demo.cc
alpar@1640: \skip include
alpar@1640: \until return
alpar@1640: \until }
athos@1530:
athos@1530: See the whole program in file \ref reader_writer_demo.cc.
athos@1530:
athos@1526:
- The following code shows how to read a graph from a stream
athos@1526: (e.g. a file) in the DIMACS file format (find the documentation of the
athos@1526: DIMACS file formats on the web).
athos@1522:
athos@1181: \code
athos@1181: Graph g;
athos@1181: std::ifstream f("graph.dim");
athos@1181: readDimacs(f, g);
athos@1181: \endcode
athos@1522:
athos@1526: One can also store network (graph+capacity on the edges) instances and
athos@1526: other things (minimum cost flow instances etc.) in DIMACS format and
athos@1534: read these in LEMON: to see the details read the documentation of the
athos@1534: \ref dimacs.h "Dimacs file format reader".
athos@1522:
athos@1514:
athos@1514: - If you want to solve some transportation problems in a network then
athos@1175: you will want to find shortest paths between nodes of a graph. This is
athos@1175: usually solved using Dijkstra's algorithm. A utility
athos@1175: that solves this is the \ref lemon::Dijkstra "LEMON Dijkstra class".
athos@1522: The following code is a simple program using the
athos@1530: \ref lemon::Dijkstra "LEMON Dijkstra class": it calculates the shortest path between node \c s and \c t in a graph \c g.
athos@1530: We omit the part reading the graph \c g and the length map \c len.
athos@1175:
athos@1528: \dontinclude dijkstra_demo.cc
athos@1528: \skip ListGraph
athos@1530: \until Graph g
athos@1530: ...
athos@1530: \skip Dijkstra algorithm
athos@1528: \until std::cout << g.id(s)
athos@1175:
alpar@1287: See the whole program in \ref dijkstra_demo.cc.
athos@1183:
athos@1530: Some explanation: after instantiating a member of the Dijkstra class
athos@1530: we run the Dijkstra algorithm from node \c s. After this we read some
athos@1530: of the results. You can do much more with the Dijkstra class, for
athos@1530: example you can run it step by step and gain full control of the
athos@1530: execution. For a detailed description, see the documentation of the
athos@1530: \ref lemon::Dijkstra "LEMON Dijkstra class".
athos@1183:
athos@1183:
zsuzska@1578:
- If you want to design a network and want to minimize the total
zsuzska@1578: length of wires then you might be looking for a minimum spanning
zsuzska@1578: tree in an undirected graph. This can be found using the Kruskal
zsuzska@1584: algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does this
zsuzska@1584: job for you.
zsuzska@1584:
zsuzska@1584: First make a graph \c g and a cost map \c
zsuzska@1584: edge_cost_map, then make a bool edgemap \c tree_map or a vector \c
zsuzska@1584: tree_edge_vec for the algorithm output. After calling the function it
zsuzska@1584: gives back the weight of the minimum spanning tree and the \c tree_map or
zsuzska@1584: the \c tree_edge_vec contains the edges of the tree.
zsuzska@1584:
zsuzska@1584: If you want to store the edges in a bool edgemap, then use the
zsuzska@1584: function as follows:
athos@1175:
zsuzska@1578: \dontinclude kruskal_demo.cc
zsuzska@1584: \skip Kruskal with boolmap;
zsuzska@1584: \until std::endl
zsuzska@1578:
zsuzska@1584: And if you rather use a vector instead of a bool map:
athos@1580:
zsuzska@1584: \skip Kruskal with vector;
zsuzska@1584: \until std::endl
zsuzska@1578:
zsuzska@1578: See the whole program in \ref kruskal_demo.cc.
zsuzska@1578:
zsuzska@1578:
athos@1511:
athos@1517:
- Many problems in network optimization can be formalized by means
athos@1517: of a linear programming problem (LP problem, for short). In our
athos@1517: library we decided not to write an LP solver, since such packages are
athos@1517: available in the commercial world just as well as in the open source
athos@1517: world, and it is also a difficult task to compete these. Instead we
athos@1517: decided to develop an interface that makes it easier to use these
athos@1517: solvers together with LEMON. The advantage of this approach is
athos@1517: twofold. Firstly our C++ interface is more comfortable than the
athos@1517: solvers' native interface. Secondly, changing the underlying solver in
athos@1517: a certain software using LEMON's LP interface needs zero effort. So,
athos@1517: for example, one may try his idea using a free solver, demonstrate its
athos@1517: usability for a customer and if it works well, but the performance
athos@1517: should be improved, then one may decide to purchase and use a better
athos@1517: commercial solver.
athos@1517:
athos@1517: So far we have an
athos@1526: interface for the commercial LP solver software \b CPLEX (developed by ILOG)
athos@1514: and for the open source solver \b GLPK (a shorthand for Gnu Linear Programming
athos@1517: Toolkit).
athos@1514:
athos@1514: We will show two examples, the first one shows how simple it is to formalize
athos@1514: and solve an LP problem in LEMON, while the second one shows how LEMON
athos@1514: facilitates solving network optimization problems using LP solvers.
athos@1514:
athos@1514:
athos@1514: - The following code shows how to solve an LP problem using the LEMON lp
athos@1517: interface. The code together with the comments is self-explanatory.
athos@1511:
athos@1530: \dontinclude lp_demo.cc
athos@1530: \skip A default solver is taken
athos@1530: \until End of LEMON style code
athos@1175:
athos@1514: See the whole code in \ref lp_demo.cc.
athos@1514:
athos@1517:
- The second example shows how easy it is to formalize a max-flow
athos@1517: problem as an LP problem using the LEMON LP interface: we are looking
athos@1517: for a real valued function defined on the edges of the digraph
athos@1517: satisfying the nonnegativity-, the capacity constraints and the
athos@1517: flow-conservation constraints and giving the largest flow value
athos@1517: between to designated nodes.
athos@1517:
athos@1517: In the following code we suppose that we already have the graph \c g,
athos@1517: the capacity map \c cap, the source node \c s and the target node \c t
athos@1517: in the memory. We will also omit the typedefs.
athos@1517:
athos@1530: \dontinclude lp_maxflow_demo.cc
athos@1530: \skip Define a map on the edges for the variables of the LP problem
athos@1530: \until lp.max();
athos@1530: \skip Solve with the underlying solver
athos@1530: \until lp.solve();
athos@1517:
athos@1517:
athos@1517: The complete program can be found in file \ref lp_maxflow_demo.cc. After compiling run it in the form:
athos@1517:
athos@1528: ./lp_maxflow_demo < sample.lgf
athos@1517:
athos@1528: where sample.lgf is a file in the lemon format containing a maxflow instance (designated "source", "target" nodes and "capacity" map on the edges).
athos@1517:
athos@1517:
athos@1514:
athos@1514:
athos@1514:
athos@1175:
athos@1175: */