PGROUTING  2.5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
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 "GraphDefinition.h"
33 #include "utils.h"
34 
35 
37  edge_t *edges,
38  size_t edge_count,
39  restrict_t *restricts,
40  size_t restrict_count,
41  int64_t start_vertex,
42  int64_t end_vertex,
43  bool directed,
44  bool has_reverse_cost,
45  path_element_tt **path,
46  size_t *path_count,
47  char **err_msg
48  ) {
49  try {
50  std::vector<PDVI> ruleTable;
51 
52  size_t i, j;
53  ruleTable.clear();
54  for (i = 0; i < restrict_count; i++) {
55  std::vector<long> seq;
56  seq.clear();
57  seq.push_back(restricts[i].target_id);
58  for (j = 0; j < MAX_RULE_LENGTH && restricts[i].via[j] > -1; j++) {
59  seq.push_back(restricts[i].via[j]);
60  }
61  ruleTable.push_back(make_pair(restricts[i].to_cost, seq));
62  }
63 
64  GraphDefinition gdef;
65  int res = gdef.my_dijkstra(edges, edge_count, start_vertex, end_vertex,
66  directed, has_reverse_cost, path, path_count, err_msg, ruleTable);
67 
68 
69  if (res < 0)
70  return res;
71  else
72  return EXIT_SUCCESS;
73  }
74  catch(std::exception& e) {
75  *err_msg = (char *) e.what();
76  return -1;
77  }
78  catch(...) {
79  *err_msg = (char *) "Caught unknown exception!";
80  return -1;
81  }
82 }
83 
85  edge_t *edges,
86  size_t edge_count,
87  restrict_t *restricts,
88  size_t restrict_count,
89  int64_t start_edge,
90  double start_pos,
91  int64_t end_edge,
92  double end_pos,
93  bool directed,
94  bool has_reverse_cost,
95  path_element_tt **path,
96  size_t *path_count,
97  char **err_msg
98  ) {
99  try {
100  std::vector<PDVI> ruleTable;
101 
102  size_t i, j;
103  ruleTable.clear();
104  for (i = 0; i < restrict_count; i++) {
105  std::vector<long> seq;
106  seq.clear();
107  seq.push_back(restricts[i].target_id);
108  for (j = 0; j < MAX_RULE_LENGTH && restricts[i].via[j] >- 1; j++) {
109  seq.push_back(restricts[i].via[j]);
110  }
111  ruleTable.push_back(make_pair(restricts[i].to_cost, seq));
112  }
113 
114  GraphDefinition gdef;
115  auto res = gdef.my_dijkstra(edges, edge_count, start_edge, start_pos,
116  end_edge, end_pos, directed, has_reverse_cost, path, path_count,
117  err_msg, ruleTable);
118 
119 
120  if (res < 0)
121  return res;
122  else
123  return EXIT_SUCCESS;
124  }
125  catch(std::exception& e) {
126  *err_msg = (char *) e.what();
127  return -1;
128  }
129  catch(...) {
130  *err_msg = (char *) "Caught unknown exception!";
131  return -1;
132  }
133 }
static edge_t edges[22573]
Definition: trsp.h:31
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:36
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:84
#define MAX_RULE_LENGTH
Definition: trsp.h:25
int via[5]
Definition: trsp.h:42