ShannonTree.Fast
Back to table
/*
Shannon-Tree
ShannonTree.Fast
[BDD tree]=ShannonTree.Fast(LogicFunction F);
F : a logic function
tree : a logic function in the BDD form
Create the tree of the given logic-function with the fast algorithm.
The result very depends on the selection of the first few variables. Hence, sometimes it returns some unexpected terrible result.
*/
//-------------------------------------------------------------------
// examples
f = AndOr()
{
2,4;
1,-3;
-1,2,3;
-1,2,3,4;
-2,-4;
}
g=ShannonTree.Fast(f);
Print(f,g);
//-------------------------------------------------------------------
// result
IsBlankFunction IsUnateFunctionTo AndXor ToAndOr FromBinary List ToBinary BinaryNumberToString bool() ToPOS ToShannonTree ToVariableInvertedFunction DiagramGateName ExcitationTable Imply minterm() Not MantissaToPositiveDecimal RadixFromIndex RadixToIndex To2LayerNor SOP Sequential GetExcitationTable Implementation BestVariableOrder DontCare AdjustLogicVariableCount XORP Zero
The website is simply translated by using the Google Translate. Please inform us if you find the wrong/funny/weird translation.