Main bookkeeping data structure for approximation algorithms. More...
Collaboration diagram for ApproxInfo:
Data Fields | |
| DdNode * | one |
| DdNode * | zero |
| NodeData * | page |
| DdHashTable * | table |
| int | index |
| double | max |
| int | size |
| double | minterms |
Detailed Description
Main bookkeeping data structure for approximation algorithms.
Field Documentation
◆ index
| int ApproxInfo::index |
index of the current node
◆ max
| double ApproxInfo::max |
max number of minterms
◆ minterms
| double ApproxInfo::minterms |
how many minterms are left
◆ one
| DdNode* ApproxInfo::one |
one constant
◆ page
| NodeData* ApproxInfo::page |
per-node information
◆ size
| int ApproxInfo::size |
how many nodes are left
◆ table
| DdHashTable* ApproxInfo::table |
hash table to access the per-node info
◆ zero
| DdNode* ApproxInfo::zero |
BDD zero constant
The documentation for this struct was generated from the following file:
- cudd/cuddApprox.c
