45 std::vector< Line_graph_full_rt > edge_result,
48 (*return_tuples) =
pgr_alloc(edge_result.size(), (*return_tuples));
50 for (
const auto &
edge : edge_result) {
51 (*return_tuples)[sequence] =
70 std::ostringstream log;
71 std::ostringstream err;
72 std::ostringstream notice;
87 log << digraph <<
"\n";
94 std::vector< Line_graph_full_rt > line_graph_edges;
95 line_graph_edges = line.get_postgres_results_directed();
97 auto count = line_graph_edges.size();
100 (*return_tuples) = NULL;
104 "No paths found between start_vid and end_vid vertices";
112 (*return_count) = sequence;
115 log << line.log.str().c_str() <<
"\n\n\n";
119 *log_msg = log.str().empty()?
122 *notice_msg = notice.str().empty()?
126 (*return_tuples) =
pgr_free(*return_tuples);
128 err << except.
what();
129 *err_msg =
pgr_msg(err.str().c_str());
130 *log_msg =
pgr_msg(log.str().c_str());
131 }
catch (std::exception &except) {
132 (*return_tuples) =
pgr_free(*return_tuples);
134 err << except.what();
135 *err_msg =
pgr_msg(err.str().c_str());
136 *log_msg =
pgr_msg(log.str().c_str());
138 (*return_tuples) =
pgr_free(*return_tuples);
140 err <<
"Caught unknown exception!";
141 *err_msg =
pgr_msg(err.str().c_str());
142 *log_msg =
pgr_msg(log.str().c_str());