PGROUTING  2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
max_flow_many_to_one.c
Go to the documentation of this file.
1 /*PGR-GNU*****************************************************************
2 File: max_flow_many_to_one.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_many_to_one(PG_FUNCTION_ARGS);
43 
44 /******************************************************************************/
45 /* MODIFY AS NEEDED */
46 static
47 void
49  char *edges_sql,
50  ArrayType *starts,
51  int64_t sink_vertex,
52  char *algorithm,
53  bool only_flow,
54  pgr_flow_t **result_tuples,
55  size_t *result_count) {
56  if (!(strcmp(algorithm, "push_relabel") == 0
57  || strcmp(algorithm, "edmonds_karp") == 0
58  || strcmp(algorithm, "boykov_kolmogorov") == 0)) {
59  elog(ERROR, "Unknown algorithm");
60  }
61 
63 
64  size_t size_source_verticesArr = 0;
65  int64_t* source_vertices =
66  pgr_get_bigIntArray(&size_source_verticesArr, starts);
67 
68  /* NOTE:
69  * For flow, cost and reverse_cost are really capacity and reverse_capacity
70  */
71  pgr_edge_t *edges = NULL;
72  size_t total_tuples = 0;
73  pgr_get_flow_edges(edges_sql, &edges, &total_tuples);
74 
75  if (total_tuples == 0) {
76  if (source_vertices) pfree(source_vertices);
78  return;
79  }
80 
81  PGR_DBG("Starting timer");
82  clock_t start_t = clock();
83  char* log_msg = NULL;
84  char* notice_msg = NULL;
85  char *err_msg = NULL;
87  edges, total_tuples,
88  source_vertices, size_source_verticesArr,
89  &sink_vertex, 1,
90  algorithm,
91  only_flow,
92 
93  result_tuples, result_count,
94  &log_msg,
95  &notice_msg,
96  &err_msg);
97 
98  if (only_flow) {
99  time_msg("pgr_maxFlow(many to many)",
100  start_t, clock());
101  } else if (strcmp(algorithm, "push_relabel") == 0) {
102  time_msg("pgr_maxFlowPushRelabel(many to one)",
103  start_t, clock());
104  } else if (strcmp(algorithm, "edmonds_karp") == 0) {
105  time_msg("pgr_maxFlowEdmondsKarp(many to one)",
106  start_t, clock());
107  } else {
108  time_msg("pgr_maxFlowBoykovKolmogorov(many to one)",
109  start_t, clock());
110  }
111 
112  if (edges) pfree(edges);
113  if (source_vertices) pfree(source_vertices);
114 
115  if (err_msg && (*result_tuples)) {
116  pfree(*result_tuples);
117  (*result_tuples) = NULL;
118  (*result_count) = 0;
119  }
120 
121  pgr_global_report(log_msg, notice_msg, err_msg);
122 
123  if (log_msg) pfree(log_msg);
124  if (notice_msg) pfree(notice_msg);
125  if (err_msg) pfree(err_msg);
126 
127 
128  pgr_SPI_finish();
129 }
130 /* */
131 /******************************************************************************/
132 
134 PGDLLEXPORT Datum
135 max_flow_many_to_one(PG_FUNCTION_ARGS) {
136  FuncCallContext *funcctx;
137  TupleDesc tuple_desc;
138 
139  /**************************************************************************/
140  pgr_flow_t *result_tuples = 0;
141  size_t result_count = 0;
142  /**************************************************************************/
143 
144  if (SRF_IS_FIRSTCALL()) {
145  MemoryContext oldcontext;
146  funcctx = SRF_FIRSTCALL_INIT();
147  oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
148 
149 
150  /**********************************************************************/
151 
152  process(
153  text_to_cstring(PG_GETARG_TEXT_P(0)),
154  PG_GETARG_ARRAYTYPE_P(1),
155  PG_GETARG_INT64(2),
156  text_to_cstring(PG_GETARG_TEXT_P(3)),
157  PG_GETARG_BOOL(4),
158  &result_tuples,
159  &result_count);
160 
161  /**********************************************************************/
162 
163 #if PGSQL_VERSION > 95
164  funcctx->max_calls = result_count;
165 #else
166  funcctx->max_calls = (uint32_t)result_count;
167 #endif
168  funcctx->user_fctx = result_tuples;
169  if (get_call_result_type(fcinfo, NULL, &tuple_desc)
170  != TYPEFUNC_COMPOSITE) {
171  ereport(ERROR,
172  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
173  errmsg("function returning record called in context "
174  "that cannot accept type record")));
175  }
176 
177  funcctx->tuple_desc = tuple_desc;
178  MemoryContextSwitchTo(oldcontext);
179  }
180 
181  funcctx = SRF_PERCALL_SETUP();
182  tuple_desc = funcctx->tuple_desc;
183  result_tuples = (pgr_flow_t *) funcctx->user_fctx;
184 
185  if (funcctx->call_cntr < funcctx->max_calls) {
186  HeapTuple tuple;
187  Datum result;
188  Datum *values;
189  bool *nulls;
190  size_t call_cntr = funcctx->call_cntr;
191 
192  /**********************************************************************/
193  values = palloc(6 * sizeof(Datum));
194  nulls = palloc(6 * sizeof(bool));
195 
196  size_t i;
197  for (i = 0; i < 6; ++i) {
198  nulls[i] = false;
199  }
200 
201  values[0] = Int32GetDatum(call_cntr + 1);
202  values[1] = Int64GetDatum(result_tuples[call_cntr].edge);
203  values[2] = Int64GetDatum(result_tuples[call_cntr].source);
204  values[3] = Int64GetDatum(result_tuples[call_cntr].target);
205  values[4] = Int64GetDatum(result_tuples[call_cntr].flow);
206  values[5] = Int64GetDatum(result_tuples[call_cntr].residual_capacity);
207  /**********************************************************************/
208 
209  tuple = heap_form_tuple(tuple_desc, values, nulls);
210  result = HeapTupleGetDatum(tuple);
211  SRF_RETURN_NEXT(funcctx, result);
212  } else {
213  SRF_RETURN_DONE(funcctx);
214  }
215 }
216 
PGDLLEXPORT Datum max_flow_many_to_one(PG_FUNCTION_ARGS)
#define PGR_DBG(...)
Definition: debug_macro.h:34
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)
PG_FUNCTION_INFO_V1(max_flow_many_to_one)
char * err_msg
Definition: BDATester.cpp:50
static void process(char *edges_sql, ArrayType *starts, int64_t sink_vertex, char *algorithm, bool only_flow, pgr_flow_t **result_tuples, size_t *result_count)