cudd
3.0.0
The University of Colorado Decision Diagram Package
|
Node of the boolean network. More...
#include <bnet.h>
Data Fields | |
char * | name |
int | type |
int | ninp |
int | nfo |
char ** | inputs |
BnetTabline * | f |
int | polarity |
int | active |
int | var |
DdNode * | dd |
int | exdc_flag |
struct BnetNode * | exdc |
int | count |
int | level |
int | visited |
struct BnetNode * | next |
Node of the boolean network.
There is one node in the network for each primary input and for each .names directive. This structure has a field to point to the DD of the node function. The function may be either in terms of primary inputs, or it may be in terms of the local inputs. The latter implies that each node has a variable index associated to it at some point in time. The field "var" stores that variable index, and "active" says if the association is currently valid. (It is indeed possible for an index to be associated to different nodes at different times.)
int BnetNode::active |
node has variable associated to it (1) or not (0)
int BnetNode::count |
auxiliary field for DD dropping
DdNode* BnetNode::dd |
decision diagram for the function of this node
struct BnetNode* BnetNode::exdc |
pointer to exdc of dd node
int BnetNode::exdc_flag |
whether an exdc node or not
BnetTabline* BnetNode::f |
truth table for this node
char** BnetNode::inputs |
input names
int BnetNode::level |
maximum distance from the inputs
char* BnetNode::name |
name of the output signal
struct BnetNode* BnetNode::next |
pointer to implement the linked list of nodes
int BnetNode::nfo |
number of fanout nodes for this node
int BnetNode::ninp |
number of inputs to the node
int BnetNode::polarity |
f is the onset (0) or the offset (1)
int BnetNode::type |
input, internal, constant, ...
int BnetNode::var |
DD variable index associated to this node
int BnetNode::visited |
flag for search