#include <eg_min_cut.h>
Collaboration diagram for EGalgMCgraph_t:

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 )
Definition at line 215 of file eg_min_cut.h.
Data Fields | |
| EGalgMCedge_t * | all_edges |
| EGalgMCnode_t * | all_nodes |
| unsigned int * | cut |
| unsigned int | cut_sz |
| EGlpNum_t | cut_val |
| EGlpNum_t | epsilon |
| EGsrkGraph_t | G |
| EGeList_t | lvl_list [5] |
|
|
Array containing all edges of the graph.
Definition at line 235 of file eg_min_cut.h. |
|
|
Array containing all nodes of the graph.
Definition at line 234 of file eg_min_cut.h. |
|
|
Array storing the current cut, the size of this array should be at least EGsrkGraph_t::n_onodes
Definition at line 231 of file eg_min_cut.h. |
|
|
number of nodes in the current best cut, if set to zero, then no cut has been found (so far) Definition at line 227 of file eg_min_cut.h. |
|
|
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
Definition at line 219 of file eg_min_cut.h. |
|
|
error tolerance used for equality testing
Definition at line 218 of file eg_min_cut.h. |
|
|
Actual shrinking graph used
Definition at line 217 of file eg_min_cut.h. |
|
|
List of nodes in different levels of tests
Definition at line 230 of file eg_min_cut.h. |
1.4.5