PGROUTING  2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
max_flow_one_to_many.c
Go to the documentation of this file.
1 /*PGR-GNU*****************************************************************
2 File: max_flow_one_to_many.c
3 
4 Generated with Template by:
5 Copyright (c) 2015 pgRouting developers
6 Mail: project@pgrouting.org
7 
8 Function's developer:
9 Copyright (c) 2016 Andrea Nardelli
10 Mail: nrd.nardelli@gmail.com
11 
12 ------
13 
14 This program is free software; you can redistribute it and/or modify
15 it under the terms of the GNU General Public License as published by
16 the Free Software Foundation; either version 2 of the License, or
17 (at your option) any later version.
18 
19 This program is distributed in the hope that it will be useful,
20 but WITHOUT ANY WARRANTY; without even the implied warranty of
21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 GNU General Public License for more details.
23 
24 You should have received a copy of the GNU General Public License
25 along with this program; if not, write to the Free Software
26 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
27 
28 ********************************************************************PGR-GNU*/
29 
30 #include "./../../common/src/postgres_connection.h"
31 #include "utils/array.h"
32 
33 #include "./../../common/src/debug_macro.h"
34 #include "./../../common/src/e_report.h"
35 #include "./../../common/src/time_msg.h"
36 #include "./../../common/src/pgr_types.h"
37 #include "./../../common/src/edges_input.h"
38 #include "./../../common/src/arrays_input.h"
39 #include "./max_flow_driver.h"
40 
41 PGDLLEXPORT Datum
42 max_flow_one_to_many(PG_FUNCTION_ARGS);
43 
44 /******************************************************************************/
45 static
46 void
48  char *edges_sql,
49  int64_t source_vertex,
50  ArrayType *ends,
51  char *algorithm,
52  bool only_flow,
53  pgr_flow_t **result_tuples,
54  size_t *result_count) {
55  if (!(strcmp(algorithm, "push_relabel") == 0
56  || strcmp(algorithm, "edmonds_karp") == 0
57  || strcmp(algorithm, "boykov_kolmogorov") == 0)) {
58  elog(ERROR, "Unknown algorithm");
59  }
60 
62 
63  size_t size_sink_verticesArr = 0;
64  int64_t* sink_vertices =
65  pgr_get_bigIntArray(&size_sink_verticesArr, ends);
66 
67 
68 
69  /* NOTE:
70  * For flow, cost and reverse_cost are really capacity and reverse_capacity
71  */
72  size_t total_tuples = 0;
73  pgr_edge_t *edges = NULL;
74  pgr_get_flow_edges(edges_sql, &edges, &total_tuples);
75 
76  if (total_tuples == 0) {
77  if (sink_vertices) pfree(sink_vertices);
79  return;
80  }
81 
82  PGR_DBG("Starting processing");
83  clock_t start_t = clock();
84  char* log_msg = NULL;
85  char* notice_msg = NULL;
86  char* err_msg = NULL;
87 
89  edges, total_tuples,
90  &source_vertex, 1,
91  sink_vertices, size_sink_verticesArr,
92  algorithm,
93  only_flow,
94 
95  result_tuples, result_count,
96 
97  &log_msg,
98  &notice_msg,
99  &err_msg);
100 
101  if (only_flow) {
102  time_msg("pgr_maxFlow(many to many)",
103  start_t, clock());
104  } else if (strcmp(algorithm, "push_relabel") == 0) {
105  time_msg("pgr_maxFlowPushRelabel(one to many)",
106  start_t, clock());
107  } else if (strcmp(algorithm, "edmonds_karp") == 0) {
108  time_msg("pgr_maxFlowEdmondsKarp(one to many)",
109  start_t, clock());
110  } else {
111  time_msg("pgr_maxFlowBoykovKolmogorov(one to many)",
112  start_t, clock());
113  }
114 
115 
116  if (edges) pfree(edges);
117  if (sink_vertices) pfree(sink_vertices);
118 
119  if (err_msg && (*result_tuples)) {
120  pfree(*result_tuples);
121  (*result_tuples) = NULL;
122  (*result_count) = 0;
123  }
124 
125  pgr_global_report(log_msg, notice_msg, err_msg);
126 
127  if (log_msg) pfree(log_msg);
128  if (notice_msg) pfree(notice_msg);
129  if (err_msg) pfree(err_msg);
130 
131  pgr_SPI_finish();
132 }
133 
135 PGDLLEXPORT Datum
136 max_flow_one_to_many(PG_FUNCTION_ARGS) {
137  FuncCallContext *funcctx;
138  TupleDesc tuple_desc;
139 
140  /**************************************************************************/
141  pgr_flow_t *result_tuples = 0;
142  size_t result_count = 0;
143  /**************************************************************************/
144 
145  if (SRF_IS_FIRSTCALL()) {
146  MemoryContext oldcontext;
147  funcctx = SRF_FIRSTCALL_INIT();
148  oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
149 
150 
151  /**********************************************************************/
152 
153  process(
154  text_to_cstring(PG_GETARG_TEXT_P(0)),
155  PG_GETARG_INT64(1),
156  PG_GETARG_ARRAYTYPE_P(2),
157  text_to_cstring(PG_GETARG_TEXT_P(3)),
158  PG_GETARG_BOOL(4),
159  &result_tuples,
160  &result_count);
161 
162  /**********************************************************************/
163 
164 #if PGSQL_VERSION > 95
165  funcctx->max_calls = result_count;
166 #else
167  funcctx->max_calls = (uint32_t)result_count;
168 #endif
169  funcctx->user_fctx = result_tuples;
170  if (get_call_result_type(fcinfo, NULL, &tuple_desc)
171  != TYPEFUNC_COMPOSITE) {
172  ereport(ERROR,
173  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
174  errmsg("function returning record called in context "
175  "that cannot accept type record")));
176  }
177 
178  funcctx->tuple_desc = tuple_desc;
179  MemoryContextSwitchTo(oldcontext);
180  }
181 
182  funcctx = SRF_PERCALL_SETUP();
183  tuple_desc = funcctx->tuple_desc;
184  result_tuples = (pgr_flow_t *) funcctx->user_fctx;
185 
186  if (funcctx->call_cntr < funcctx->max_calls) {
187  HeapTuple tuple;
188  Datum result;
189  Datum *values;
190  bool *nulls;
191  size_t call_cntr = funcctx->call_cntr;
192 
193  /**********************************************************************/
194 
195  values = palloc(6 * sizeof(Datum));
196  nulls = palloc(6 * sizeof(bool));
197 
198  size_t i;
199  for (i = 0; i < 6; ++i) {
200  nulls[i] = false;
201  }
202 
203  values[0] = Int32GetDatum(call_cntr + 1);
204  values[1] = Int64GetDatum(result_tuples[call_cntr].edge);
205  values[2] = Int64GetDatum(result_tuples[call_cntr].source);
206  values[3] = Int64GetDatum(result_tuples[call_cntr].target);
207  values[4] = Int64GetDatum(result_tuples[call_cntr].flow);
208  values[5] = Int64GetDatum(result_tuples[call_cntr].residual_capacity);
209 
210  /**********************************************************************/
211 
212  tuple = heap_form_tuple(tuple_desc, values, nulls);
213  result = HeapTupleGetDatum(tuple);
214  SRF_RETURN_NEXT(funcctx, result);
215  } else {
216  SRF_RETURN_DONE(funcctx);
217  }
218 }
219 
#define PGR_DBG(...)
Definition: debug_macro.h:34
PG_FUNCTION_INFO_V1(max_flow_one_to_many)
int64_t * pgr_get_bigIntArray(size_t *arrlen, ArrayType *input)
Definition: arrays_input.c:127
void time_msg(char *msg, clock_t start_t, clock_t end_t)
Definition: time_msg.c:32
void do_pgr_max_flow(pgr_edge_t *data_edges, size_t total_tuples, int64_t *source_vertices, size_t size_source_verticesArr, int64_t *sink_vertices, size_t size_sink_verticesArr, char *algorithm, bool only_flow, pgr_flow_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
void pgr_global_report(char *log, char *notice, char *err)
notice & error
Definition: e_report.c:93
void pgr_SPI_finish(void)
void pgr_get_flow_edges(char *sql, pgr_edge_t **edges, size_t *total_edges)
read edges for flow
Definition: edges_input.c:529
edge_astar_t * edges
Definition: BDATester.cpp:46
void pgr_SPI_connect(void)
char * err_msg
Definition: BDATester.cpp:50
static void process(char *edges_sql, int64_t source_vertex, ArrayType *ends, char *algorithm, bool only_flow, pgr_flow_t **result_tuples, size_t *result_count)
PGDLLEXPORT Datum max_flow_one_to_many(PG_FUNCTION_ARGS)