About
A Boolean function can be represented as a rooted directed, acyclic graph, which consists of several decision nodes and terminal nodes.
Articles Related
Example
- Structure: Data Mining - Decision Tree (DT) Algorithm
A Boolean function can be represented as a rooted directed, acyclic graph, which consists of several decision nodes and terminal nodes.