Converting binary decision diagram to truth table
Given a binary decision diagram, how do I convert it into a truth table? What is the exact algorithm for it ? I have been trying this for a long time. Here is an example which one can follow:
Source: Wikipedia.
(The dotted edges represent 0; solid edges, 1.)
Solution
Beginning at the root node, traverse tree in depth-first manner.
For each leaf node reached, record an entry in truth table as follows:
x1is 0 if you descended the dashed edge from nodex1; 1 otherwise.x2is 0 if you descended the dashed edge from nodex2; 1 otherwise.x3is 0 if you descended the dashed edge from nodex3; 1 otherwise.fis value of the leaf node.
- Rounding up to the nearest multiple of a number
- How do I optimize my 2D Array Point Searcher
- Split triangle sphere grid to hexagonal (Goldberg hexasphere)
- Algorithm for deriving control points of a bezier curve from points along that curve?
- Rabin-Karp algorithm in c++
- How do I check if an array includes a value in JavaScript?
- Simpler way of sorting three numbers
- Data Structure Problem - Reverse Chronological Order
- Why do we use `length-i-1` in the inner loop of bubble sort algorithm
- Peak signal detection in realtime timeseries data
- Parallel and distributed algorithms for matrix multiplication
- Sort unique numbers with memory constraints
- Binary Tree Level Order Traversal problems
- Find nth SET bit in an int
- Moon / Lunar Phase Algorithm
- Boolean method to check array is sorted in java
- Is it good practice to use global variables in recursion
- Nice Label Algorithm for Charts with minimum ticks
- When to mark visited in iterative DFS? at push or at pop
- Function to compare my age to somebody else's age
- Explanation of Merge Sort for Dummies
- How to speed up query that use postgis extension?
- Ideas for converting straight quotes to curly quotes
- Fast sigmoid algorithm
- Algorithm to implement kinetic scrolling
- Codility - min average slice
- MaxCounters (lesson 4 in codility) - 100% correctness but 60% on efficiency, why?
- What is the best 32bit hash function for short strings (tag names)?
- recursion versus iteration
- Efficient algorithm to count contiguous subarrays that can form arithmetic progressions