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