#include <stddef.h>
#include "c_types/routes_t.h"
#include "c_types/pgr_edge_t.h"
Go to the source code of this file.
|
void | do_pgr_dijkstraVia (pgr_edge_t *data_edges, size_t total_edges, int64_t *via_vidsArr, size_t size_via_vidsArr, bool directed, bool strict, bool U_turn_on_edge, Routes_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg) |
|
◆ do_pgr_dijkstraVia()
void do_pgr_dijkstraVia |
( |
pgr_edge_t * |
data_edges, |
|
|
size_t |
total_edges, |
|
|
int64_t * |
via_vidsArr, |
|
|
size_t |
size_via_vidsArr, |
|
|
bool |
directed, |
|
|
bool |
strict, |
|
|
bool |
U_turn_on_edge, |
|
|
Routes_t ** |
return_tuples, |
|
|
size_t * |
return_count, |
|
|
char ** |
log_msg, |
|
|
char ** |
notice_msg, |
|
|
char ** |
err_msg |
|
) |
| |
Definition at line 90 of file dijkstraVia_driver.cpp.
101 std::ostringstream log;
102 std::ostringstream err;
103 std::ostringstream notice;
115 std::deque< Path >paths;
116 log <<
"\nInserting vertices into a c++ vector structure";
117 std::vector< int64_t > via_vertices(
118 via_vidsArr, via_vidsArr + size_via_vidsArr);
121 log <<
"\nWorking with directed Graph";
123 digraph.insert_edges(data_edges, total_edges);
132 log <<
"\nWorking with Undirected Graph";
134 undigraph.insert_edges(data_edges, total_edges);
147 (*return_tuples) = NULL;
151 *log_msg =
pgr_msg(notice.str().c_str());
156 (*return_tuples) =
pgr_alloc(count, (*return_tuples));
157 log <<
"\nConverting a set of paths into the tuples";
158 (*return_count) = (
get_route(return_tuples, paths));
159 (*return_tuples)[count - 1].edge = -2;
161 *log_msg = log.str().empty()?
164 *notice_msg = notice.str().empty()?
168 (*return_tuples) =
pgr_free(*return_tuples);
170 err << except.
what();
171 *err_msg =
pgr_msg(err.str().c_str());
172 *log_msg =
pgr_msg(log.str().c_str());
173 }
catch (std::exception &except) {
174 (*return_tuples) =
pgr_free(*return_tuples);
176 err << except.what();
177 *err_msg =
pgr_msg(err.str().c_str());
178 *log_msg =
pgr_msg(log.str().c_str());
180 (*return_tuples) =
pgr_free(*return_tuples);
182 err <<
"Caught unknown exception!";
183 *err_msg =
pgr_msg(err.str().c_str());
184 *log_msg =
pgr_msg(log.str().c_str());
References count_tuples(), DIRECTED, get_route(), pgrouting::graph::Pgr_base_graph< G, T_V, T_E >::insert_edges(), pgassert, pgr_alloc(), pgRouting::pgr_dijkstraVia(), pgr_free(), pgr_msg(), UNDIRECTED, and AssertFailedException::what().
Referenced by process().