26 typedef struct _MinCut MinCut;
37 MinCut *
minc_create(
int nArcs,
const int tail[],
const int head[],
const int _cap[],
int s,
int t );
50 int minc_n( MinCut *minc );
int minc_n_cut(MinCut *minc)
number of arcs in minimum cut
MinCut * minc_create(int nArcs, const int tail[], const int head[], const int _cap[], int s, int t)
creates a min cut solver
int minc_cut_arc_destination(MinCut *minc, int i)
returns the i-th arc destination in the cut
void minc_free(MinCut **_minc)
frees memory of mincut solver
char minc_in_s(MinCut *minc, int i)
checks if a node is in the subset of the source node or not
int minc_cut_arc_source(MinCut *minc, int i)
returns the i-th arc source in the cut
int minc_n(MinCut *minc)
number of nodes in graph
int minc_optimize(MinCut *minc)
solves the min cut problem