cudd  3.0.0
The University of Colorado Decision Diagram Package
Data Structures
Here are the data structures with brief descriptions:
 C_cstringstreamType of a simple extensible string buffer
 CABDDClass for ADDs and BDDs
 CADDClass for ADDs
 CApproxInfoMain bookkeeping data structure for approximation algorithms
 CAssortedInfoAssorted information needed by the BuildSubsetBdd procedure
 CBDDClass for BDDs
 CBnetNetworkVery simple boolean network data structure
 CBnetNodeNode of the boolean network
 CBnetTablineType to store a line of the truth table of a node
 CCapsuleClass for reference counting of CUDD managers
 CConjunctsType of a pair of conjoined BDDs
 CCuddClass for CUDD managers
 CcuddPathPairType of item stored in memoization table
 CDDBase class for all decision diagrams in CUDD
 CDdCacheComputed table
 CDdChildrenThe two children of a non-terminal node
 CDdGenCUDD generator
 CDdHashItemLocal hash table item
 CDdHashTableLocal hash table
 CDdHookCUDD hook
 CDdLevelQueueLevel queue
 CDdLocalCacheLocal cache
 CDdLocalCacheItemGeneric local cache item
 CDdManagerSpecialized DD symbol table
 CDdNodeDecision diagram node
 CDdQueueItemGeneric level queue item
 CDdSubtableSubtable for one index
 CDdTlcInfoThis structure holds the set of clauses for a node
 CEpDoubleStructExtended precision double to keep very large value
 CEpTypeUnionDifferent views of a double
 CflowStatsStructStructure to hold statistics
 CGeneticInfoMiscellaneous information
 CGlobalInfoBookkeeping data structure for subsetting algorithm
 CGlobalQueueItemItem of the queue used in the levelized traversal of the BDD
 ChackThis is a hack for when CUDD_VALUE_TYPE is double
 ChashEntry
 CIeeeDoubleStructIEEE double struct
 CIeeeNanStructIEEE double NaN struct
 CIndexKeyUsed to sort variables for reordering
 CjoinThreadsClass to join threads in RAII fashion
 CLocalQueueItemType of the item of the local queue
 CMarkCacheKey
 CMoveReordering move record
 CMtrNode_Multi-way tree node
 CmysJust some struct type
 CNodeDataData structure to store the information on each node
 CNodeDistStructure created to store subset results for each node and distances with odd and even parity of the node from the root and sink
 CNodeStatStats for one node
 CNtrHeapHeap-based priority queue
 CNtrHeapSlotEntry of NtrHeap
 CNtrOptionsOptions for nanotrav
 CNtrPartTRData structure for partitioned transition relation
 Cst_generatorSymbol table generator
 Cst_tableSymbol table header
 Cst_table_entrySymbol table entry
 CSubsetInfoMiscellaneous info
 CTaskTaks performed by each thread
 CTlClauseThis structure is for temporary representation of sets of clauses
 CZDDClass for ZDDs