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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
/*PGR-GNU*****************************************************************
Copyright (c) 2015 pgRouting developers
Mail: project@pgrouting.org
Ignroing directed flag & works only for undirected graph
Copyright (c) 2022 Celia Vriginia Vergara Castillo
Mail: vicky at georepublic.mail
Function's developer:
Copyright (c) 2016 Andrea Nardelli
Mail: nrd.nardelli@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_MAX_FLOW_PGR_MAXIMUMCARDINALITYMATCHING_HPP_
#define INCLUDE_MAX_FLOW_PGR_MAXIMUMCARDINALITYMATCHING_HPP_
#pragma once
#include <map>
#include <vector>
#include <utility>
#include <set>
#include <algorithm>
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/max_cardinality_matching.hpp>
#include "c_types/edge_bool_t_rt.h"
namespace pgrouting {
namespace flow {
class PgrCardinalityGraph {
using G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS>;
public:
G boost_graph;
typedef typename boost::graph_traits<G>::vertex_descriptor V;
typedef typename boost::graph_traits<G>::edge_descriptor E;
typedef typename boost::graph_traits<G>::vertex_iterator V_it;
typedef typename boost::graph_traits<G>::edge_iterator E_it;
std::map<int64_t, V> id_to_V;
std::map<V, int64_t> V_to_id;
std::map<E, int64_t> E_to_id;
V get_boost_vertex(int64_t id) {
return id_to_V[id];
}
int64_t get_vertex_id(V v) {
return V_to_id[v];
}
int64_t get_edge_id(E e) {
return E_to_id[e];
}
PgrCardinalityGraph(Edge_bool_t_rt *data_edges, size_t total_tuples) {
std::set<int64_t> vertices;
for (size_t i = 0; i < total_tuples; ++i) {
vertices.insert(data_edges[i].source);
vertices.insert(data_edges[i].target);
}
for (int64_t id : vertices) {
V v = add_vertex(boost_graph);
id_to_V.insert(std::pair<int64_t, V>(id, v));
V_to_id.insert(std::pair<V, int64_t>(v, id));
}
bool added;
for (size_t i = 0; i < total_tuples; ++i) {
V v1 = get_boost_vertex(data_edges[i].source);
V v2 = get_boost_vertex(data_edges[i].target);
E e1;
E e2;
if (data_edges[i].going) {
boost::tie(e1, added) = boost::add_edge(v1, v2, boost_graph);
E_to_id.insert(std::pair<E, int64_t>(e1, data_edges[i].id));
}
}
}
std::vector<Edge_bool_t_rt>
get_matched_vertices() {
/* TODO(v4) source & target are to be removed */
std::vector<V> mate_map(boost::num_vertices(boost_graph));
std::vector<Edge_bool_t_rt> matched_vertices;
maximum_cardinality_matching(mate_map);
V_it vi, vi_end;
E e;
bool exists;
/*
* Check for each vertex:
* 1) It is matched with a non-null vertex
* 2) An edge exists from this vertex to his mate
* 3) The vertices have not been matched already
* (this last point prevents having double output with reversed
* source and target)
*/
for (boost::tie(vi, vi_end) = boost::vertices(boost_graph);
vi != vi_end;
++vi) {
boost::tie(e, exists) =
boost::edge(*vi, mate_map[*vi], boost_graph);
if (((uint64_t)mate_map[*vi]
!= boost::graph_traits<G>::null_vertex())
&& (*vi < (uint64_t)mate_map[*vi])) {
Edge_bool_t_rt matched_couple;
matched_couple.source = get_vertex_id(*vi);
matched_couple.target = get_vertex_id(mate_map[*vi]);
matched_couple.edge_id = get_edge_id(e);
matched_vertices.push_back(matched_couple);
}
}
std::sort(matched_vertices.begin(), matched_vertices.end(),
[](const Edge_bool_t_rt &a, const Edge_bool_t_rt &b)
-> bool { return a.edge_id < b.edge_id; });
return matched_vertices;
}
void maximum_cardinality_matching(std::vector<V> &mate_map) {
edmonds_maximum_cardinality_matching(boost_graph,
&mate_map[0]);
}
};
} // namespace flow
} // namespace pgrouting
#endif // INCLUDE_MAX_FLOW_PGR_MAXIMUMCARDINALITYMATCHING_HPP_
|
