PGROUTING  2.5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
ksp_driver.cpp
Go to the documentation of this file.
1 /*PGR-GNU*****************************************************************
2 File: ksp_driver.cpp
3 
4 Copyright (c) 2015 Celia Virginia Vergara Castillo
5 vicky_vergara@hotmail.com
6 
7 ------
8 
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
13 
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18 
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
22 
23 ********************************************************************PGR-GNU*/
24 
25 
26 #include "drivers/yen/ksp_driver.h"
27 
28 #include <sstream>
29 #include <deque>
30 #include <vector>
31 
32 #include "yen/pgr_ksp.hpp"
33 
34 #include "cpp_common/pgr_alloc.hpp"
35 #include "cpp_common/pgr_assert.h"
36 
38 
39 
40 
42  pgr_edge_t *data_edges,
43  size_t total_edges,
44  int64_t start_vid,
45  int64_t end_vid,
46  int k,
47  bool directed,
48  bool heap_paths,
49  General_path_element_t **return_tuples,
50  size_t *return_count,
51  char ** log_msg,
52  char ** notice_msg,
53  char ** err_msg) {
54  std::ostringstream err;
55  std::ostringstream log;
56  std::ostringstream notice;
57  try {
58  pgassert(!(*log_msg));
59  pgassert(!(*notice_msg));
60  pgassert(!(*err_msg));
61  pgassert(!(*return_tuples));
62  pgassert(*return_count == 0);
63  pgassert(total_edges != 0);
64  log << "buuu";
65 
66  graphType gType = directed? DIRECTED: UNDIRECTED;
67 
68  std::deque< Path > paths;
69 
70  if (directed) {
71  pgrouting::DirectedGraph digraph(gType);
73  digraph.insert_edges(data_edges, total_edges);
74  paths = fn_yen.Yen(digraph, start_vid, end_vid, k, heap_paths);
75  } else {
76  pgrouting::UndirectedGraph undigraph(gType);
78  undigraph.insert_edges(data_edges, total_edges);
79  paths = fn_yen.Yen(undigraph, start_vid, end_vid, k, heap_paths);
80  }
81 
82 
83  auto count(count_tuples(paths));
84 
85  if (!(count == 0)) {
86  // get the space required to store all the paths
87  *return_tuples = NULL;
88  *return_tuples = pgr_alloc(count, (*return_tuples));
89 
90  size_t sequence = 0;
91  int route_id = 0;
92  for (const auto &path : paths) {
93  if (path.size() > 0)
94  path.get_pg_ksp_path(return_tuples, sequence, route_id);
95  ++route_id;
96  }
97  }
98  *return_count = count;
99 
100  pgassert(*err_msg == NULL);
101  *log_msg = log.str().empty()?
102  nullptr :
103  strdup(log.str().c_str());
104  *notice_msg = notice.str().empty()?
105  nullptr :
106  strdup(notice.str().c_str());
107  } catch (AssertFailedException &except) {
108  if (*return_tuples) free(*return_tuples);
109  (*return_count) = 0;
110  err << except.what();
111  *err_msg = strdup(err.str().c_str());
112  *log_msg = strdup(log.str().c_str());
113  } catch (std::exception& except) {
114  if (*return_tuples) free(*return_tuples);
115  (*return_count) = 0;
116  err << except.what();
117  *err_msg = strdup(err.str().c_str());
118  *log_msg = strdup(log.str().c_str());
119  } catch(...) {
120  if (*return_tuples) free(*return_tuples);
121  (*return_count) = 0;
122  err << "Caught unknown exception!";
123  *err_msg = strdup(err.str().c_str());
124  *log_msg = strdup(log.str().c_str());
125  }
126 }
Extends std::exception and is the exception that we throw if an assert fails.
Definition: pgr_assert.h:126
void insert_edges(const T *edges, int64_t count)
Inserts count edges of type T into the graph.
#define pgassert(expr)
Uses the standard assert syntax.
Definition: pgr_assert.h:81
void do_pgr_ksp(pgr_edge_t *data_edges, size_t total_edges, int64_t start_vid, int64_t end_vid, int k, bool directed, bool heap_paths, General_path_element_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
Definition: ksp_driver.cpp:41
size_t count_tuples(const std::deque< Path > &paths)
T * pgr_alloc(std::size_t size, T *ptr)
allocates memory
Definition: pgr_alloc.hpp:64
Assertions Handling.
virtual const char * what() const
Definition: pgr_assert.cpp:53
std::deque< Path > Yen(G &graph, int64_t source, int64_t target, int K, bool heap_paths)
Definition: pgr_ksp.hpp:148
graphType
Definition: graph_enum.h:30