通过python字典进行递归查找以创建Graphviz

import graphviz

def create_graphviz(d, dot, parent_node=None, parent_label=None):
    for key, value in d.items():
        if isinstance(value, dict):
            # 如果值是字典类型，则递归调用函数
            node = graphviz.Node(str(key))
            dot.node(str(node))
            if parent_node is not None:
                dot.edge(str(parent_node), str(node), label=str(parent_label))
            create_graphviz(value, dot, parent_node=node, parent_label=key)
        else:
            # 如果值不是字典类型，则创建节点并添加到图中
            node = graphviz.Node(str(key) + ": " + str(value))
            dot.node(str(node))
            if parent_node is not None:
                dot.edge(str(parent_node), str(node), label=str(parent_label))

dot = graphviz.Digraph()

data = {
    "A": {
        "B": {
            "C": 1,
            "D": 2
        },
        "E": {
            "F": 3,
            "G": 4
        }
    }
}

create_graphviz(data, dot)

dot.render("graphviz_output", format="png")