-
-
Notifications
You must be signed in to change notification settings - Fork 374
/
Copy pathboyerMyrvold_driver.cpp
135 lines (109 loc) · 4.03 KB
/
boyerMyrvold_driver.cpp
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
/*PGR-GNU*****************************************************************
File: boyerMyrvold_driver.cpp
Generated with Template by:
Copyright (c) 2020 pgRouting developers
Mail: project@pgrouting.org
Function's developer:
Copyright (c) 2020 Himanshu Raj
Mail: raj.himanshu2@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*/
#include "drivers/planar/boyerMyrvold_driver.h"
#include <vector>
#include <algorithm>
#include <string>
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/pgr_assert.hpp"
#include "cpp_common/pgdata_getters.hpp"
#include "c_types/iid_t_rt.h"
#include "planar/pgr_boyerMyrvold.hpp"
#include "cpp_common/pgr_base_graph.hpp"
void
pgr_do_boyerMyrvold(
char *edges_sql,
IID_t_rt **return_tuples,
size_t *return_count,
char ** log_msg,
char ** notice_msg,
char ** err_msg) {
using pgrouting::pgr_alloc;
using pgrouting::to_pg_msg;
using pgrouting::pgr_free;
using pgrouting::pgget::get_edges;
std::ostringstream log;
std::ostringstream err;
std::ostringstream notice;
char* hint = nullptr;
try {
pgassert(!(*log_msg));
pgassert(!(*notice_msg));
pgassert(!(*err_msg));
pgassert(!(*return_tuples));
pgassert(*return_count == 0);
std::vector<IID_t_rt> results;
std::string logstr;
graphType gType = UNDIRECTED;
hint = edges_sql;
auto edges = get_edges(std::string(edges_sql), true, true);
if (edges.empty()) {
throw std::string("No edges found");
}
hint = nullptr;
log << "Working with Undirected Graph\n";
pgrouting::UndirectedGraph undigraph(directed);
undigraph.insert_edges(edges);
pgrouting::functions::Pgr_boyerMyrvold<pgrouting::UndirectedGraph> fn_boyerMyrvold;
results = fn_boyerMyrvold.boyerMyrvold(undigraph);
logstr += fn_boyerMyrvold.get_log();
log << logstr;
auto count = results.size();
if (count == 0) {
(*return_tuples) = NULL;
(*return_count) = 0;
notice <<
"No Vertices";
*log_msg = to_pg_msg(notice);
return;
}
(*return_tuples) = pgr_alloc(count, (*return_tuples));
for (size_t i = 0; i < count; i++) {
*((*return_tuples) + i) = results[i];
}
(*return_count) = count;
pgassert(*err_msg == NULL);
*log_msg = to_pg_msg(log);
*notice_msg = to_pg_msg(notice);
} catch (AssertFailedException &except) {
(*return_tuples) = pgr_free(*return_tuples);
(*return_count) = 0;
err << except.what();
*err_msg = to_pg_msg(err);
*log_msg = to_pg_msg(log);
} catch (const std::string &ex) {
*err_msg = to_pg_msg(ex);
*log_msg = hint? to_pg_msg(hint) : to_pg_msg(log);
} catch (std::exception &except) {
(*return_tuples) = pgr_free(*return_tuples);
(*return_count) = 0;
err << except.what();
*err_msg = to_pg_msg(err);
*log_msg = to_pg_msg(log);
} catch(...) {
(*return_tuples) = pgr_free(*return_tuples);
(*return_count) = 0;
err << "Caught unknown exception!";
*err_msg = to_pg_msg(err);
*log_msg = to_pg_msg(log);
}
}