PGROUTING  2.6
trsp_core.cpp
Go to the documentation of this file.
1 /*PGR-GNU*****************************************************************
2 
3 File: trsp_core.cpp
4 
5 Generated with Template by:
6 Copyright (c) 2015 pgRouting developers
7 Mail: project@pgrouting.org
8 
9 ------
10 
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 2 of the License, or
14 (at your option) any later version.
15 
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
20 
21 You should have received a copy of the GNU General Public License
22 along with this program; if not, write to the Free Software
23 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
24 
25 ********************************************************************PGR-GNU*/
26 
27 #ifdef __MINGW32__
28 #include <winsock2.h>
29 #include <windows.h>
30 #endif
31 
32 #include "trsp/GraphDefinition.h"
33 
34 
36  edge_t *edges,
37  size_t edge_count,
38  restrict_t *restricts,
39  size_t restrict_count,
40  int64_t start_vertex,
41  int64_t end_vertex,
42  bool directed,
43  bool has_reverse_cost,
44  path_element_tt **path,
45  size_t *path_count,
46  char **err_msg
47  ) {
48  try {
49  std::vector<PDVI> ruleTable;
50 
51  size_t i, j;
52  ruleTable.clear();
53  for (i = 0; i < restrict_count; i++) {
54  std::vector<long> seq;
55  seq.clear();
56  seq.push_back(restricts[i].target_id);
57  for (j = 0; j < MAX_RULE_LENGTH && restricts[i].via[j] > -1; j++) {
58  seq.push_back(restricts[i].via[j]);
59  }
60  ruleTable.push_back(make_pair(restricts[i].to_cost, seq));
61  }
62 
63  GraphDefinition gdef;
64  int res = gdef.my_dijkstra(edges, edge_count, start_vertex, end_vertex,
65  directed, has_reverse_cost, path, path_count, err_msg, ruleTable);
66 
67 
68  if (res < 0)
69  return res;
70  else
71  return EXIT_SUCCESS;
72  }
73  catch(std::exception& e) {
74  *err_msg = (char *) e.what();
75  return -1;
76  }
77  catch(...) {
78  *err_msg = (char *) "Caught unknown exception!";
79  return -1;
80  }
81 }
82 
84  edge_t *edges,
85  size_t edge_count,
86  restrict_t *restricts,
87  size_t restrict_count,
88  int64_t start_edge,
89  double start_pos,
90  int64_t end_edge,
91  double end_pos,
92  bool directed,
93  bool has_reverse_cost,
94  path_element_tt **path,
95  size_t *path_count,
96  char **err_msg
97  ) {
98  try {
99  std::vector<PDVI> ruleTable;
100 
101  size_t i, j;
102  ruleTable.clear();
103  for (i = 0; i < restrict_count; i++) {
104  std::vector<long> seq;
105  seq.clear();
106  seq.push_back(restricts[i].target_id);
107  for (j = 0; j < MAX_RULE_LENGTH && restricts[i].via[j] >- 1; j++) {
108  seq.push_back(restricts[i].via[j]);
109  }
110  ruleTable.push_back(make_pair(restricts[i].to_cost, seq));
111  }
112 
113  GraphDefinition gdef;
114  auto res = gdef.my_dijkstra(edges, edge_count, start_edge, start_pos,
115  end_edge, end_pos, directed, has_reverse_cost, path, path_count,
116  err_msg, ruleTable);
117 
118 
119  if (res < 0)
120  return res;
121  else
122  return EXIT_SUCCESS;
123  }
124  catch(std::exception& e) {
125  *err_msg = (char *) e.what();
126  return -1;
127  }
128  catch(...) {
129  *err_msg = (char *) "Caught unknown exception!";
130  return -1;
131  }
132 }
int via[5]
Definition: trsp.h:42
int trsp_node_wrapper(edge_t *edges, size_t edge_count, restrict_t *restricts, size_t restrict_count, int64_t start_vertex, int64_t end_vertex, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg)
Definition: trsp_core.cpp:35
int my_dijkstra(long start_vertex, long end_vertex, size_t edge_count, char **err_msg)
int trsp_edge_wrapper(edge_t *edges, size_t edge_count, restrict_t *restricts, size_t restrict_count, int64_t start_edge, double start_pos, int64_t end_edge, double end_pos, bool directed, bool has_reverse_cost, path_element_tt **path, size_t *path_count, char **err_msg)
Definition: trsp_core.cpp:83
#define MAX_RULE_LENGTH
Definition: trsp.h:25