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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
igraph library.
Copyright (C) 2003-2025 The igraph development team <igraph@igraph.org>
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, see <https://www.gnu.org/licenses/>.
*/
#ifndef IGRAPH_FLOW_H
#define IGRAPH_FLOW_H
#include "igraph_decls.h"
#include "igraph_constants.h"
#include "igraph_error.h"
#include "igraph_types.h"
#include "igraph_datatype.h"
#include "igraph_vector_list.h"
IGRAPH_BEGIN_C_DECLS
/* -------------------------------------------------- */
/* Maximum flows, minimum cuts & such */
/* -------------------------------------------------- */
/**
* \typedef igraph_maxflow_stats_t
* \brief Data structure holding statistics from the push-relabel maximum flow solver.
*
* \param nopush The number of push operations performed.
* \param norelabel The number of relabel operarions performed.
* \param nogap The number of times the gap heuristics was used.
* \param nogapnodes The total number of vertices that were
* omitted form further calculations because of the gap
* heuristics.
* \param nobfs The number of times the reverse BFS was run to
* assign good values to the height function. This includes
* an initial run before the whole algorithm, so it is always
* at least one.
*/
typedef struct {
igraph_int_t nopush, norelabel, nogap, nogapnodes, nobfs;
} igraph_maxflow_stats_t;
IGRAPH_EXPORT igraph_error_t igraph_maxflow(const igraph_t *graph, igraph_real_t *value,
igraph_vector_t *flow, igraph_vector_int_t *cut,
igraph_vector_int_t *partition, igraph_vector_int_t *partition2,
igraph_int_t source, igraph_int_t target,
const igraph_vector_t *capacity,
igraph_maxflow_stats_t *stats);
IGRAPH_EXPORT igraph_error_t igraph_maxflow_value(const igraph_t *graph, igraph_real_t *value,
igraph_int_t source, igraph_int_t target,
const igraph_vector_t *capacity,
igraph_maxflow_stats_t *stats);
IGRAPH_EXPORT igraph_error_t igraph_st_mincut(const igraph_t *graph, igraph_real_t *value,
igraph_vector_int_t *cut, igraph_vector_int_t *partition,
igraph_vector_int_t *partition2,
igraph_int_t source, igraph_int_t target,
const igraph_vector_t *capacity);
IGRAPH_EXPORT igraph_error_t igraph_st_mincut_value(const igraph_t *graph, igraph_real_t *res,
igraph_int_t source, igraph_int_t target,
const igraph_vector_t *capacity);
IGRAPH_EXPORT igraph_error_t igraph_mincut_value(const igraph_t *graph, igraph_real_t *res,
const igraph_vector_t *capacity);
IGRAPH_EXPORT igraph_error_t igraph_mincut(const igraph_t *graph,
igraph_real_t *value,
igraph_vector_int_t *partition,
igraph_vector_int_t *partition2,
igraph_vector_int_t *cut,
const igraph_vector_t *capacity);
IGRAPH_EXPORT igraph_error_t igraph_st_vertex_connectivity(const igraph_t *graph,
igraph_int_t *res,
igraph_int_t source,
igraph_int_t target,
igraph_vconn_nei_t neighbors);
IGRAPH_EXPORT igraph_error_t igraph_vertex_connectivity(const igraph_t *graph, igraph_int_t *res,
igraph_bool_t checks);
IGRAPH_EXPORT igraph_error_t igraph_st_edge_connectivity(const igraph_t *graph, igraph_int_t *res,
igraph_int_t source,
igraph_int_t target);
IGRAPH_EXPORT igraph_error_t igraph_edge_connectivity(const igraph_t *graph, igraph_int_t *res,
igraph_bool_t checks);
IGRAPH_EXPORT igraph_error_t igraph_edge_disjoint_paths(const igraph_t *graph, igraph_int_t *res,
igraph_int_t source,
igraph_int_t target);
IGRAPH_EXPORT igraph_error_t igraph_vertex_disjoint_paths(const igraph_t *graph, igraph_int_t *res,
igraph_int_t source,
igraph_int_t target);
IGRAPH_EXPORT igraph_error_t igraph_adhesion(const igraph_t *graph, igraph_int_t *res,
igraph_bool_t checks);
IGRAPH_EXPORT igraph_error_t igraph_cohesion(const igraph_t *graph, igraph_int_t *res,
igraph_bool_t checks);
/* s-t cut listing related stuff */
IGRAPH_EXPORT igraph_error_t igraph_even_tarjan_reduction(const igraph_t *graph, igraph_t *graphbar,
igraph_vector_t *capacity);
IGRAPH_EXPORT igraph_error_t igraph_residual_graph(const igraph_t *graph,
const igraph_vector_t *capacity,
igraph_t *residual,
igraph_vector_t *residual_capacity,
const igraph_vector_t *flow);
IGRAPH_EXPORT igraph_error_t igraph_reverse_residual_graph(const igraph_t *graph,
const igraph_vector_t *capacity,
igraph_t *residual,
const igraph_vector_t *flow);
IGRAPH_EXPORT igraph_error_t igraph_dominator_tree(const igraph_t *graph,
igraph_int_t root,
igraph_vector_int_t *dom,
igraph_t *domtree,
igraph_vector_int_t *leftout,
igraph_neimode_t mode);
IGRAPH_EXPORT igraph_error_t igraph_all_st_cuts(const igraph_t *graph,
igraph_vector_int_list_t *cuts,
igraph_vector_int_list_t *partition1s,
igraph_int_t source,
igraph_int_t target);
IGRAPH_EXPORT igraph_error_t igraph_all_st_mincuts(const igraph_t *graph, igraph_real_t *value,
igraph_vector_int_list_t *cuts,
igraph_vector_int_list_t *partition1s,
igraph_int_t source,
igraph_int_t target,
const igraph_vector_t *capacity);
IGRAPH_EXPORT igraph_error_t igraph_gomory_hu_tree(const igraph_t *graph,
igraph_t *tree,
igraph_vector_t *flows,
const igraph_vector_t *capacity);
IGRAPH_END_C_DECLS
#endif
|
