EGalgPRnode_t Struct Reference
[EGalgPushRelabel]

#include <eg_push_relabel.h>

Collaboration diagram for EGalgPRnode_t:

[legend]

---

Detailed Description

Node structure neede to run Push-Relabel algorithm on a network.

Note:

Notice that the directed graph part is embeded in this structure as well. Note that we could define internally space for LVL_list, but for the sake of speed we include them in the node structure.

Examples:

eg_push_relabel.ex.c.

Definition at line 142 of file eg_push_relabel.h.

Data Fields
unsigned int	d
EGlpNum_t	e
EGeList_t	LVL_list
EGeList_t	T_cut
EGeDgraphNode_t	v

---

Field Documentation

unsigned int EGalgPRnode_t::d

Exact label distance for this node. Note that nodes with distance lables (where n is the number of nodes in the graph) define the minimum cut that we are looking for. Definition at line 155 of file eg_push_relabel.h.

EGlpNum_t EGalgPRnode_t::e

Exess flow in the node. Note that in particular the excess on node t (once EGalgPRminSTcut finish) correspond to the minimum cut value. Definition at line 160 of file eg_push_relabel.h.

EGeList_t EGalgPRnode_t::LVL_list

Used to store the BFS list used for the first computations of the exact label distances, and then to store this node in it's current level list (this is used to implement the Highest-Label variant of the Preflow-Push algorithm) Definition at line 145 of file eg_push_relabel.h.

EGeList_t EGalgPRnode_t::T_cut

Used to speed-up the 'hole' heuristic, it is seted once we enter the algorithm, so their value is non-important outside the function (but it's contents will be lost once we enter EGalgPRminSTcut). Definition at line 150 of file eg_push_relabel.h.

EGeDgraphNode_t EGalgPRnode_t::v

Actual node structure to work with (EGeDgraph) Examples: eg_push_relabel.ex.c. Definition at line 144 of file eg_push_relabel.h.

---

The documentation for this struct was generated from the following file:

• eg_push_relabel.h

---