[ Reference Manual | Alphabetic Index ]

library(all_min_cuts)

Curet et al, algorithm for generating all minimum-cost cuts

Predicates

all_min_cuts(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MaxFlowEdges, -MinCuts, -MinCutEdges)
Curet et al, algorithm for generating all minimum-cost cuts
all_min_cuts(+Graph, +CapacityArg, +SourceNode, +SinkNode, +Limit, -MaxFlowValue, -MaxFlowEdges, -MinCuts, -MinCutEdges)
Curet et al, algorithm for generating all minimum-cost cuts, with limit for max number of allowed cuts
all_min_cuts_list(+Graph, +CapacityArg, +SourceSinkList, +Limit, -MinCutEdgesList)
Curet et al, algorithm for generating all minimum-cost cuts, to be used for multiple source-sink pairs on the same graph since unnecessary repeat of initializations can be avoided

Description

Algorithm for generating all minimum-cost cuts between source and sink. From Norman D. Curet, Jason DeVinney, Matthew E. Gaston. An efficient network flow code for finding all minimum cost s-t cutsets. Computers & Operations Research 29 (2002) 205-219.

About


Generated from all_min_cuts.eci on 2017-07-09 15:37