def _plot_tree()

in causalPartition.py [0:0]

• 15 lines of code
• 6 McCabe index (conditional complexity)

    def _plot_tree(self, est_result_separate, node_id, prefix):
        if node_id > 1 and node_id % 2 == 0:
            sign = '<='
        elif node_id > 1 and node_id % 2 == 1:
            sign = '> '
        else:
            sign = ''
        if 'left_result' in est_result_separate:
            print('%s%s(%d) split %s at %f, n=%d, avg=%f, se=%f' % (prefix, sign, node_id, est_result_separate['feature'], 
                est_result_separate['threshold'], est_result_separate['N'], est_result_separate['hajek'], est_result_separate['hajek_se']))
            self._plot_tree(est_result_separate['left_result'], node_id*2, prefix+'\t')
            self._plot_tree(est_result_separate['right_result'], node_id*2+1, prefix+'\t')
        else:
            print('%s%s(%d) terminate, n=%d, avg=%f, se=%f' % (prefix, sign, node_id, 
                        est_result_separate['N'], est_result_separate['hajek'], est_result_separate['hajek_se']))