alpar@399
|
1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*-
|
alpar@399
|
2 |
*
|
alpar@399
|
3 |
* This file is a part of LEMON, a generic C++ optimization library.
|
alpar@399
|
4 |
*
|
alpar@399
|
5 |
* Copyright (C) 2003-2008
|
alpar@399
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
alpar@399
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
alpar@399
|
8 |
*
|
alpar@399
|
9 |
* Permission to use, modify and distribute this software is granted
|
alpar@399
|
10 |
* provided that this copyright notice appears in all copies. For
|
alpar@399
|
11 |
* precise terms see the accompanying LICENSE file.
|
alpar@399
|
12 |
*
|
alpar@399
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
alpar@399
|
14 |
* express or implied, and with no claim as to its suitability for any
|
alpar@399
|
15 |
* purpose.
|
alpar@399
|
16 |
*
|
alpar@399
|
17 |
*/
|
alpar@399
|
18 |
|
alpar@399
|
19 |
///\ingroup demos
|
alpar@399
|
20 |
///\file
|
alpar@399
|
21 |
///\brief Demonstrating the usage of LEMON's General Flow algorithm
|
alpar@399
|
22 |
///
|
alpar@399
|
23 |
/// This demo program reads a general network circulation problem from the
|
alpar@399
|
24 |
/// file 'circulation-input.lgf', runs the preflow based algorithm for
|
alpar@399
|
25 |
/// finding a feasible solution and writes the output
|
alpar@399
|
26 |
/// to 'circulation-input.lgf'
|
alpar@399
|
27 |
///
|
alpar@399
|
28 |
/// \include circulation_demo.cc
|
alpar@399
|
29 |
|
alpar@399
|
30 |
#include <iostream>
|
alpar@399
|
31 |
|
alpar@399
|
32 |
#include <lemon/list_graph.h>
|
alpar@399
|
33 |
#include <lemon/circulation.h>
|
alpar@399
|
34 |
#include <lemon/lgf_reader.h>
|
alpar@399
|
35 |
#include <lemon/lgf_writer.h>
|
alpar@399
|
36 |
|
alpar@399
|
37 |
using namespace lemon;
|
alpar@399
|
38 |
|
alpar@399
|
39 |
|
alpar@399
|
40 |
int main (int, char*[])
|
alpar@399
|
41 |
{
|
alpar@399
|
42 |
|
alpar@399
|
43 |
typedef ListDigraph Digraph;
|
alpar@399
|
44 |
typedef Digraph::Node Node;
|
alpar@399
|
45 |
typedef Digraph::NodeIt NodeIt;
|
alpar@399
|
46 |
typedef Digraph::Arc Arc;
|
alpar@399
|
47 |
typedef Digraph::ArcIt ArcIt;
|
alpar@399
|
48 |
typedef Digraph::ArcMap<int> ArcMap;
|
alpar@399
|
49 |
typedef Digraph::NodeMap<int> NodeMap;
|
alpar@399
|
50 |
typedef Digraph::NodeMap<double> DNodeMap;
|
alpar@399
|
51 |
|
alpar@399
|
52 |
Digraph g;
|
alpar@399
|
53 |
ArcMap lo(g);
|
alpar@399
|
54 |
ArcMap up(g);
|
alpar@399
|
55 |
NodeMap delta(g);
|
alpar@399
|
56 |
NodeMap nid(g);
|
alpar@399
|
57 |
ArcMap eid(g);
|
alpar@399
|
58 |
DNodeMap cx(g);
|
alpar@399
|
59 |
DNodeMap cy(g);
|
alpar@399
|
60 |
|
alpar@399
|
61 |
DigraphReader<Digraph>(g,"circulation-input.lgf").
|
alpar@399
|
62 |
arcMap("lo_cap", lo).
|
alpar@399
|
63 |
arcMap("up_cap", up).
|
alpar@399
|
64 |
nodeMap("delta", delta).
|
alpar@399
|
65 |
arcMap("label", eid).
|
alpar@399
|
66 |
nodeMap("label", nid).
|
alpar@399
|
67 |
nodeMap("coordinates_x", cx).
|
alpar@399
|
68 |
nodeMap("coordinates_y", cy).
|
alpar@399
|
69 |
run();
|
alpar@399
|
70 |
|
alpar@399
|
71 |
Circulation<Digraph> gen(g,lo,up,delta);
|
alpar@399
|
72 |
bool ret=gen.run();
|
alpar@399
|
73 |
if(ret)
|
alpar@399
|
74 |
{
|
alpar@399
|
75 |
std::cout << "\nA feasible flow has been found.\n";
|
alpar@399
|
76 |
if(!gen.checkFlow()) std::cerr << "Oops!!!\n";
|
alpar@399
|
77 |
DigraphWriter<Digraph>(g, "circulation-output.lgf").
|
alpar@399
|
78 |
arcMap("lo_cap", lo).
|
alpar@399
|
79 |
arcMap("up_cap", up).
|
alpar@399
|
80 |
arcMap("flow", gen.flowMap()).
|
alpar@399
|
81 |
nodeMap("delta", delta).
|
alpar@399
|
82 |
arcMap("label", eid).
|
alpar@399
|
83 |
nodeMap("label", nid).
|
alpar@399
|
84 |
nodeMap("coordinates_x", cx).
|
alpar@399
|
85 |
nodeMap("coordinates_y", cy).
|
alpar@399
|
86 |
run();
|
alpar@399
|
87 |
}
|
alpar@399
|
88 |
else {
|
alpar@399
|
89 |
std::cout << "\nThere is no such a flow\n";
|
alpar@399
|
90 |
Digraph::NodeMap<int> bar(g);
|
alpar@399
|
91 |
gen.barrierMap(bar);
|
alpar@399
|
92 |
if(!gen.checkBarrier()) std::cerr << "Dual Oops!!!\n";
|
alpar@399
|
93 |
|
alpar@399
|
94 |
DigraphWriter<Digraph>(g, "circulation-output.lgf").
|
alpar@399
|
95 |
arcMap("lo_cap", lo).
|
alpar@399
|
96 |
arcMap("up_cap", up).
|
alpar@399
|
97 |
nodeMap("barrier", bar).
|
alpar@399
|
98 |
nodeMap("delta", delta).
|
alpar@399
|
99 |
arcMap("label", eid).
|
alpar@399
|
100 |
nodeMap("label", nid).
|
alpar@399
|
101 |
nodeMap("coordinates_x", cx).
|
alpar@399
|
102 |
nodeMap("coordinates_y", cy).
|
alpar@399
|
103 |
run();
|
alpar@399
|
104 |
}
|
alpar@399
|
105 |
std::cout << "The output is written to file 'circulation-output.lgf'\n\n";
|
alpar@399
|
106 |
|
alpar@399
|
107 |
}
|