1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
//=======================================================================
// Copyright 2013 University of Warsaw.
// Authors: Piotr Wygocki
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/core/lightweight_test.hpp>
#include <boost/graph/cycle_canceling.hpp>
#include <boost/graph/edmonds_karp_max_flow.hpp>
#include "min_cost_max_flow_utils.hpp"
void cycle_canceling_def_test()
{
boost::SampleGraph::vertex_descriptor s, t;
boost::SampleGraph::Graph g;
boost::SampleGraph::getSampleGraph(g, s, t);
boost::edmonds_karp_max_flow(g, s, t);
boost::cycle_canceling(g);
int cost = boost::find_flow_cost(g);
BOOST_TEST_EQ(cost, 29);
}
void path_augmentation_def_test2()
{
boost::SampleGraph::vertex_descriptor s, t;
boost::SampleGraph::Graph g;
boost::SampleGraph::getSampleGraph2(g, s, t);
boost::edmonds_karp_max_flow(g, s, t);
boost::cycle_canceling(g);
int cost = boost::find_flow_cost(g);
BOOST_TEST_EQ(cost, 7);
}
void cycle_canceling_test()
{
boost::SampleGraph::vertex_descriptor s, t;
typedef boost::SampleGraph::Graph Graph;
boost::SampleGraph::Graph g;
boost::SampleGraph::getSampleGraph(g, s, t);
int N = num_vertices(g);
std::vector< int > dist(N);
typedef boost::graph_traits< Graph >::edge_descriptor edge_descriptor;
std::vector< edge_descriptor > pred(N);
boost::property_map< Graph, boost::vertex_index_t >::const_type idx
= get(boost::vertex_index, g);
boost::edmonds_karp_max_flow(g, s, t);
boost::cycle_canceling(g,
boost::distance_map(
boost::make_iterator_property_map(dist.begin(), idx))
.predecessor_map(
boost::make_iterator_property_map(pred.begin(), idx))
.vertex_index_map(idx));
int cost = boost::find_flow_cost(g);
BOOST_TEST_EQ(cost, 29);
}
int main()
{
cycle_canceling_def_test();
path_augmentation_def_test2();
cycle_canceling_test();
return boost::report_errors();
}
|
