PGROUTING  3.2
dijkstra_driver.h
Go to the documentation of this file.
1 /*PGR-GNU*****************************************************************
2 
3 File: dijkstra_driver.h
4 
5 Generated with Template by:
6 Copyright (c) 2015 pgRouting developers
7 Mail: [email protected]
8 
9 Function's developer:
10 Copyright (c) 2015 Celia Virginia Vergara Castillo
11 Mail: [email protected]
12 
13 Copyright (c) 2020 The combinations_sql signature is added by Mahmoud SAKR
14 and Esteban ZIMANYI
15 mail: [email protected], [email protected]
16 
17 ------
18 
19 This program is free software; you can redistribute it and/or modify
20 it under the terms of the GNU General Public License as published by
21 the Free Software Foundation; either version 2 of the License, or
22 (at your option) any later version.
23 
24 This program is distributed in the hope that it will be useful,
25 but WITHOUT ANY WARRANTY; without even the implied warranty of
26 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27 GNU General Public License for more details.
28 
29 You should have received a copy of the GNU General Public License
30 along with this program; if not, write to the Free Software
31 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
32 
33  ********************************************************************PGR-GNU*/
34 
35 #ifndef INCLUDE_DRIVERS_DIJKSTRA_DIJKSTRA_DRIVER_H_
36 #define INCLUDE_DRIVERS_DIJKSTRA_DIJKSTRA_DRIVER_H_
37 
38 /* for size-t */
39 #ifdef __cplusplus
40 # include <cstddef>
41 #else
42 # include <stddef.h>
43 #endif
44 
45 #include "c_types/pgr_edge_t.h"
46 #include "c_types/pgr_combination_t.h"
47 #include "c_types/general_path_element_t.h"
48 
49 
50 #ifdef __cplusplus
51 extern "C" {
52 #endif
53 
54  // CREATE OR REPLACE FUNCTION pgr_dijkstra(
55  // sql text,
56  // start_vids anyarray,
57  // end_vids anyarray,
58  // directed boolean default true,
59  void do_pgr_many_to_many_dijkstra(
60  pgr_edge_t *data_edges,
61  size_t total_tuples,
62  int64_t *start_vidsArr,
63  size_t size_start_vidsArr,
64  int64_t *end_vidsArr,
65  size_t size_end_vidsArr,
66  bool directed,
67  bool only_cost,
68  bool normal,
69  int64_t n_goals,
70  bool global,
71 
72  General_path_element_t **return_tuples,
73  size_t *return_count,
74 
75  char** log_msg,
76  char** notice_msg,
77  char** err_msg);
78 
79 
80  // CREATE OR REPLACE FUNCTION pgr_dijkstra(
81  // sql text,
82  // combinations_sql text,
83  // directed boolean default true,
84  void do_pgr_combinations_dijkstra(
85  pgr_edge_t *data_edges,
86  size_t total_tuples,
87  pgr_combination_t *combinations,
88  size_t total_combinations,
89  bool directed,
90  bool only_cost,
91  bool normal,
92  int64_t n_goals,
93  bool global,
94 
95  General_path_element_t **return_tuples,
96  size_t *return_count,
97 
98  char** log_msg,
99  char** notice_msg,
100  char** err_msg);
101 #ifdef __cplusplus
102  }
103 #endif
104 
105 #endif // INCLUDE_DRIVERS_DIJKSTRA_DIJKSTRA_DRIVER_H_
pgr_edge_t
Definition: pgr_edge_t.h:37
pgr_combination_t.h
do_pgr_combinations_dijkstra
void do_pgr_combinations_dijkstra(pgr_edge_t *data_edges, size_t total_tuples, pgr_combination_t *combinations, size_t total_combinations, bool directed, bool only_cost, bool normal, int64_t n_goals, bool global, General_path_element_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
Definition: dijkstra_driver.cpp:262
pgr_combination_t
Definition: pgr_combination_t.h:43
General_path_element_t
Definition: general_path_element_t.h:37
do_pgr_many_to_many_dijkstra
void do_pgr_many_to_many_dijkstra(pgr_edge_t *data_edges, size_t total_tuples, int64_t *start_vidsArr, size_t size_start_vidsArr, int64_t *end_vidsArr, size_t size_end_vidsArr, bool directed, bool only_cost, bool normal, int64_t n_goals, bool global, General_path_element_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
Definition: dijkstra_driver.cpp:158
general_path_element_t.h
pgr_edge_t.h