#include <bddBdd.h>
Collaboration diagram for bddNode:

Definition at line 42 of file bddBdd.h.
Data Fields | |
| unsigned | mark:1 |
| To mark the node in garbage collection and node count. | |
| unsigned | var:31 |
| Variable id. The ids of variables are multiples of 1, starting with 0! | |
| unsigned | low |
| Index of low son. Also used for linking unused nodes in the node array. | |
| unsigned | high |
| Index of high son. | |
| unsigned | next |
| Next node in mUniqueHash-list (0 for end of list). | |
| unsigned bddNode::mark |
To mark the node in garbage collection and node count.
Definition at line 45 of file bddBdd.h.
Referenced by bddBdd::gc(), bddBdd::getGraph_(), bddBdd::getNodeNr_(), bddBdd::getNodesPerVarId_(), bddBdd::init(), bddBdd::mark(), bddBdd::testVars_(), and bddBdd::unMark().
| unsigned bddNode::var |
Variable id. The ids of variables are multiples of 1, starting with 0!
Definition at line 47 of file bddBdd.h.
Referenced by bddBdd::getGraph_(), bddBdd::getNodesPerVarId_(), bddBdd::init(), bddBdd::insert(), and bddBdd::print_().
| unsigned bddNode::low |
Index of low son. Also used for linking unused nodes in the node array.
Definition at line 49 of file bddBdd.h.
Referenced by bddBdd::getFreeNodeNr(), bddBdd::getGraph_(), and bddBdd::insert().
| unsigned bddNode::high |
Index of high son.
Definition at line 51 of file bddBdd.h.
Referenced by bddBdd::getGraph_(), and bddBdd::insert().
| unsigned bddNode::next |
Next node in mUniqueHash-list (0 for end of list).
Definition at line 53 of file bddBdd.h.
Referenced by bddBdd::gc(), and bddBdd::insert().
1.5.1