Graph Structure for Minimum Cut. More...
|unsigned int *||cut|
Graph Structure for Minimum Cut.
Note that this structure also holds some parameters as the epsilon to use in the comparisons, the current best cut found (or bound), and the current cut found so-far. As well as an array containing all edges and nodes in thee graph (remember that when we Identify two nodes, we loose any reference to the shrinked node in the graph structure as discussed in EGsrkIdentifyNodes )
|unsigned int* EGalgMCgraph_t::cut|
|unsigned int EGalgMCgraph_t::cut_sz|
if EGalgMCgraph_t::cut_sz is not zero, then this is the value of the (currenlty) best minimum cut found so far. otherwise is a bound on the value of the minimum cut (note that this value should be set before actually computing the minimum cut, and can be set to the value of for some node v in the graph.