Data Fields

EGsrkNode_t Struct Reference
[EGsrkGraph]

Node structure for shrinkable graphs. More...

#include <eg_shrink_graph.h>

Collaboration diagram for EGsrkNode_t:
Collaboration graph
[legend]

Data Fields

EGsrkEdge_thit
EGeList_t members
unsigned int mmb_sz
EGeUgraphNode_t node
EGes_t parent
EGlpNum_t weight

Detailed Description

Node structure for shrinkable graphs.

Examples:

eg_shrink_graph.ex.c.

Definition at line 74 of file eg_shrink_graph.h.


Field Documentation

used for internal purposes, in particular, while merging two adjacency lists, this field is used to store the first edge touching this node, and then used to retrieve that information. When we call EGsrkIdentifyNodes this field is assumed to be NULL

Definition at line 86 of file eg_shrink_graph.h.

list of other nodes shrunken with this node

Examples:
eg_shrink_graph.ex.c.

Definition at line 77 of file eg_shrink_graph.h.

Referenced by display_srkG(), and EGalgMCexpandNode().

unsigned int EGsrkNode_t::mmb_sz

length of the members list (without including the node itself

Definition at line 78 of file eg_shrink_graph.h.

Referenced by EGalgMCexpandNode(), and EGalgMCtestNode().

actual node structure for the graph

Examples:
eg_shrink_graph.ex.c.

Definition at line 76 of file eg_shrink_graph.h.

Referenced by display_srkG(), EGalgMCbuildPRgraph(), and main().

If this node is the representant for its class, then this is a 'parent' node, otherwise, is a shrunken node

Definition at line 80 of file eg_shrink_graph.h.

Weight of the $\delta(n)$ edges for this node (in the shrunken graph), this should be initialized by the user.

Examples:
eg_min_cut.ex.c, and eg_shrink_graph.ex.c.

Definition at line 83 of file eg_shrink_graph.h.

Referenced by display_srkG(), EGalgMCtestNode(), and main().


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