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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*PGR-GNU*****************************************************************
File: stoerWagner.hpp
Copyright (c) 2015 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2018 Aditya Pratap Singh
adityapratap.singh28@gmail.com
------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
#ifndef INCLUDE_MINCUT_STOERWAGNER_HPP_
#define INCLUDE_MINCUT_STOERWAGNER_HPP_
#pragma once
#include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <functional>
#include <limits>
#include "cpp_common/path.hpp"
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/one_bit_color_map.hpp>
#include <boost/graph/stoer_wagner_min_cut.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/typeof/typeof.hpp>
#include "cpp_common/base_graph.hpp"
#include "c_types/stoerWagner_t.h"
template < class G > class Pgr_stoerWagner;
// user's functions
// for development
//******************************************
template < class G >
class Pgr_stoerWagner {
public:
typedef typename G::V V;
typedef typename G::E E;
typedef typename G::E_i E_i;
std::vector<StoerWagner_t> stoerWagner(
G &graph);
private:
std::vector< StoerWagner_t >
generatestoerWagner(
const G &graph ) {
std::vector< StoerWagner_t > results;
auto parities = boost::make_one_bit_color_map(
num_vertices(graph.graph),
get(boost::vertex_index, graph.graph));
double w = stoer_wagner_min_cut(
graph.graph,
get(&G::G_T_E::cost, graph.graph),
boost::parity_map(parities));
double totalcost = 0;
E_i ei, ei_end;
for (boost::tie(ei, ei_end) = edges(graph.graph); ei != ei_end; ei++) {
auto s = source(*ei, graph.graph);
auto t = target(*ei, graph.graph);
if (get(parities, s) != get(parities, t)) {
StoerWagner_t tmp = {};
tmp.cost = graph[*ei].cost;
auto edge_id =
graph.get_edge_id(
source(*ei, graph.graph),
target(*ei, graph.graph),
tmp.cost);
tmp.edge = edge_id;
totalcost += tmp.cost;
tmp.mincut = totalcost;
results.push_back(tmp);
}
}
pgassert(w == totalcost);
return results;
}
};
template < class G >
std::vector<StoerWagner_t>
Pgr_stoerWagner< G >::stoerWagner(
G &graph) {
pgassert(num_vertices(graph.graph) > 1);
return generatestoerWagner(
graph);
}
#endif // INCLUDE_MINCUT_STOERWAGNER_HPP_
|
