Node structure for shrinkable graphs. More...
#include <eg_shrink_graph.h>

Data Fields | |
| EGsrkEdge_t * | hit |
| EGeList_t | members |
| unsigned int | mmb_sz |
| EGeUgraphNode_t | node |
| EGes_t | parent |
| EGlpNum_t | weight |
Node structure for shrinkable graphs.
Definition at line 74 of file eg_shrink_graph.h.
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
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
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.
| EGlpNum_t EGsrkNode_t::weight |
Weight of the
edges for this node (in the shrunken graph), this should be initialized by the user.
Definition at line 83 of file eg_shrink_graph.h.
Referenced by display_srkG(), EGalgMCtestNode(), and main().
1.7.1