EGdualCut_t Struct Reference

Structure to hold simple dual cuts, we store them as the set of edges in its interface, note that we may have edges more than once, the meaning is that the cut is defined by the edges that are an odd number of times in the array. More...

#include <eg_greedytypes.h>

Collaboration diagram for EGdualCut_t:

Collaboration graph
[legend]

Data Fields

unsigned int sz
EGdGraphEdge_t ** edges
EGdijkstraCost_t value

Detailed Description

Structure to hold simple dual cuts, we store them as the set of edges in its interface, note that we may have edges more than once, the meaning is that the cut is defined by the edges that are an odd number of times in the array.

Definition at line 168 of file eg_greedytypes.h.

Field Documentation

EGdGraphEdge_t** EGdualCut_t::edges
 

$\delta(T)$

Definition at line 171 of file eg_greedytypes.h.

unsigned int EGdualCut_t::sz
 

number of edges in $\delta(T)$

Definition at line 170 of file eg_greedytypes.h.

EGdijkstraCost_t EGdualCut_t::value
 

$value = \sum\limits_{e\in\delta(T)}x_e$

Definition at line 172 of file eg_greedytypes.h.

The documentation for this struct was generated from the following file:
Generated on Thu Oct 20 14:59:14 2005 for DominoParitySeparator by  doxygen 1.4.5