Function print_tree_ascii

visualize_mcts.py:146–214

以 ASCII 树形式打印节点树

(nodes: Dict[str, NodeInfo], root_id: str, max_depth: int = 10)

def print_tree_ascii(nodes: Dict[str, NodeInfo], root_id: str, max_depth: int = 10):
    """
    以 ASCII 树形式打印节点树
    """
    if root_id not in nodes:
        print("Error: Root node not found")
        return
    
    print("\n" + "="*80)
    print("MCTS Search Tree Visualization")
    print("="*80)
    print(f"Legend: ✓=OK ✗=FAIL ?=unknown, [r/d/i]=root/draft/improve, m=metric, [T]=terminal")
    print("="*80 + "\n")
    
    def dfs_print(node_id: str, prefix: str, is_last: bool, depth: int):
        if depth > max_depth:
            return
        
        node = nodes[node_id]
        
        # 打印当前节点
        current_prefix = "└── " if is_last else "├── "
        print(prefix + current_prefix + str(node))
        
        # 更新前缀
        extension = "    " if is_last else "│   "
        new_prefix = prefix + extension
        
        # 递归打印子节点
        children = node.children_ids
        for i, child_id in enumerate(children):
            is_last_child = (i == len(children) - 1)
            dfs_print(child_id, new_prefix, is_last_child, depth + 1)
    
    # 打印根节点
    dfs_print(root_id, "", True, 0)
    
    print("\n" + "="*80)
    print("Statistics:")
    print("="*80)
    
    # 统计信息
    stats = {
        'root': 0, 'draft': 0, 'improve': 0, 'debug': 0,
        'OK': 0, 'FAIL': 0, 'unknown': 0,
        'terminal': 0,
        'with_metric': 0
    }
    
    for node in nodes.values():
        stats[node.stage] = stats.get(node.stage, 0) + 1
        stats[node.run_status] = stats.get(node.run_status, 0) + 1
        if node.is_terminal:
            stats['terminal'] += 1
        if node.metric is not None:
            stats['with_metric'] += 1
    
    print(f"Total nodes: {len(nodes)}")