|View source on GitHub|
A decision tree node.
pretty( prefix: str, is_pos: Optional[bool], depth: int, max_depth: Optional[int] ) -> str
Returns a recursive readable textual representation of a node.
||Prefix printed on the left side. Used to print the surrounding edges.|
||True/False if the node is a positive/negative child. None if the node is a root.|
||Depth of the node in the tree. There is no assuption of on the depth of a root.|
||Maximum depth for representation. Deeper nodes are skipped.|
|A pretty-string representing the node and its children.|
Extracts the condition values and default evaluations.