abdelrahman/agent_compositor_test
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add graph references

Browse Source
This commit is contained in:
Abdelrahman Said
2026-06-28 13:49:01 +01:00
parent 0a9807e448
commit a11edf0c53
2578 changed files with 868045 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
references/igraph-1.0.1/include/igraph_flow.h
+153
View File
@@ -0,0 +1,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