Data structure to store the information on each node. More...

Collaboration diagram for NodeData:

Data Fields
double	mintermsP

double	mintermsN

int	functionRef

char	care

char	replace

short int	parity

DdNode *	resultP

DdNode *	resultN

double *	mintermPointer

int *	nodesPointer

int *	lightChildNodesPointer

Detailed Description

Data structure to store the information on each node.

It keeps the number of minterms of the function rooted at this node in terms of the number of variables specified by the user; the number of minterms of the complement; the impact of the number of minterms of this function on the number of minterms of the root function; the reference count of the node from within the root function; the flag that says whether the node intersects the care set; the flag that says whether the node should be replaced and how; the results of subsetting in both phases.

It keeps the number of minterms represented by the DAG rooted at this node in terms of the number of variables specified by the user, number of nodes in this DAG and the number of nodes of its child with lesser number of minterms that are not shared by the child with more minterms.

Field Documentation

◆ care

char NodeData::care

node intersects care set

◆ functionRef

int NodeData::functionRef

references from within this function

◆ mintermsN

double NodeData::mintermsN

minterms for the complemented node

◆ mintermsP

double NodeData::mintermsP

minterms for the regular node

◆ parity

short int NodeData::parity

1: even; 2: odd; 3: both

◆ replace

char NodeData::replace

replacement decision

◆ resultN

DdNode* NodeData::resultN

result for odd parity

◆ resultP

DdNode* NodeData::resultP

result for even parity

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

cudd/cuddApprox.c
cudd/cuddSubsetHB.c

Data Fields