TdZdd  1.1
A top-down/breadth-first decision diagram manipulation framework
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123]
 Ctdzdd::DdEval< BddCardinality< T, AR >, T >
 Ctdzdd::DdEval< E, BigNumber, std::string >
 Ctdzdd::DdEval< E, T >
 Ctdzdd::DdEval< ToZBDD, ZBDD >
 Ctdzdd::ToZBDDExporter to ZBDD
 Ctdzdd::DdEval< ZddCardinality< T, AR >, T >
 Ctdzdd::DdSpecBase< BddLookahead< S >, S::ARITY >
 Ctdzdd::DdSpecBase< BddUnreduction< S >, AR >
 Ctdzdd::PodArrayDdSpec< BddUnreduction< S >, size_t, S::ARITY >
 Ctdzdd::DdSpecBase< CycleZdd, AR >
 Ctdzdd::PodArrayDdSpec< CycleZdd, int16_t, 2 >
 Ctdzdd::DdSpecBase< DdStructure< ARITY >, AR >
 Ctdzdd::DdSpec< DdStructure< ARITY >, NodeId, ARITY >
 Ctdzdd::DdStructure< ARITY >Ordered n-ary decision diagram structure
 Ctdzdd::DdSpecBase< DegreeConstraint, AR >
 Ctdzdd::PodArrayDdSpec< DegreeConstraint, int16_t, 2 >
 Ctdzdd::DdSpecBase< FrontierBasedSearch, AR >
 Ctdzdd::HybridDdSpec< FrontierBasedSearch, FrontierBasedSearchCount, FrontierBasedSearchMate, 2 >
 Ctdzdd::DdSpecBase< GraphillionZdd, AR >
 Ctdzdd::DdSpec< GraphillionZdd, uint64_t, 2 >
 Ctdzdd::DdSpecBase< HamiltonCycleZdd, AR >
 Ctdzdd::PodArrayDdSpec< HamiltonCycleZdd, int16_t, 2 >
 Ctdzdd::DdSpecBase< HamiltonPathZdd, AR >
 Ctdzdd::PodArrayDdSpec< HamiltonPathZdd, int16_t, 2 >
 Ctdzdd::DdSpecBase< LinearConstraints< T >, AR >
 Ctdzdd::PodArrayDdSpec< LinearConstraints< T >, T, 2 >
 Ctdzdd::DdSpecBase< PathZdd, AR >
 Ctdzdd::PodArrayDdSpec< PathZdd, int16_t, 2 >
 Ctdzdd::DdSpecBase< PathZddByStdMap, AR >
 Ctdzdd::DdSpec< PathZddByStdMap, std::map< int16_t, int16_t >, 2 >
 Ctdzdd::DdSpecBase< SapporoZdd, AR >
 Ctdzdd::DdSpec< SapporoZdd, ZBDD, 2 >
 Ctdzdd::SapporoZddZBDD wrapper
 Ctdzdd::DdSpecBase< SizeConstraint, AR >
 Ctdzdd::DdSpec< SizeConstraint, int, 2 >
 Ctdzdd::DdSpecBase< T, AR >
 Ctdzdd::PodArrayDdSpec< T, size_t, S::ARITY >
 Ctdzdd::DdSpecBase< ZddLookahead< S >, S::ARITY >
 Ctdzdd::DdSpecBase< ZddUnreduction< S >, AR >
 Ctdzdd::PodArrayDdSpec< ZddUnreduction< S >, size_t, S::ARITY >
 Ctdzdd::DdSweeper< AR >
 Ctdzdd::MyHashTable< MyHashMapEntry< K, V >, MyHashMapHashWrapper< K, V, Hash, Equal >, MyHashMapHashWrapper< K, V, Hash, Equal > >
 Ctdzdd::MyHashMap< K, V, Hash, Equal >Closed hash map implementation
 Ctdzdd::BddCardinality< T, AR >BDD evaluator that counts the number of elements
 Ctdzdd::DdBuilder< S >Basic breadth-first DD builder
 Ctdzdd::DdBuilderMP< S >Multi-threaded breadth-first DD builder
 Ctdzdd::DdDumper< S >DD dumper
 Ctdzdd::DdEval< E, T, R >Base class of DD evaluators
 Ctdzdd::DdSpecBase< S, AR >Base class of DD specs
 Ctdzdd::PodArrayDdSpec< S, int16_t, 2 >
 Ctdzdd::PodArrayDdSpec< S, size_t, 2 >
 Ctdzdd::DdSpec< S, T, AR >Abstract class of DD specifications using scalar states
 Ctdzdd::HybridDdSpec< S, TS, TA, AR >Abstract class of DD specifications using both scalar and POD array states
 Ctdzdd::PodArrayDdSpec< S, T, AR >Abstract class of DD specifications using POD array states
 Ctdzdd::StatelessDdSpec< S, AR >Abstract class of DD specifications without states
 Ctdzdd::DdStructure< ARITY >::const_iteratorIterator on a set of integer vectors represented by a DD
 Ctdzdd::DdSweeper< ARITY >On-the-fly DD cleaner
 Ctdzdd::DdValues< T, ARITY >Collection of child node values/levels for DdEval::evalNode function interface
 Ctdzdd::MemoryPoolMemory pool
 Ctdzdd::MyHashMapEntry< K, V >Entry for a hash map
 Ctdzdd::MyHashTable< T, Hash, Equal >Closed hash table implementation
 Ctdzdd::ZddCardinality< T, AR >ZDD evaluator that counts the number of elements
 Ctdzdd::ZddSubsetter< S >Breadth-first ZDD subset builder
 Ctdzdd::ZddSubsetterMP< S >Multi-threaded breadth-first ZDD subset builder