如何从大字典中绘制树形图

Question

我的字典很大，基本上一些字典值相交，我想以图表的形式表示。

My_dictionary = { A : {1 , 2, 4 }, B : {1,3}, C : {5} ..... etc}

期望的结果是将节点 A、B、C 链接到字典值的这些端点的图表。我尝试了树形图和 graphviz，但仍然无法弄清楚如何自动化这个过程。我什至尝试通过将端点设为对角线并使用余弦相似度填充数据框来创建热图。请帮忙

Answer 1

这是我对您要查找的内容的最佳猜测。

import networkx as nx

my_dictionary = { 'A' : {1 , 2, 4 }, 'B' : {1,3}, 'C' : {5}}
G = nx.Graph()
G.add_edges_from([k,x] for k,v in my_dictionary.items() for x in v)
nx.draw(G, pos = nx.bipartite_layout(G,my_dictionary.keys()), 
        with_labels = True, node_color = 'orange')

结果：

---

仅使用单边节点：

import networkx as nx
import matplotlib.pyplot as plt
from collections import defaultdict

my_dictionary = { 'A' : {1 , 2, 4 }, 'B' : {1,3}, 'C' : {5}}
G = nx.Graph()
G.add_edges_from([k,x] for k,v in my_dictionary.items() for x in v)

pos = nx.bipartite_layout(G,my_dictionary.keys())
nx.draw(G, pos = pos,with_labels = True, node_color = 'orange')
plt.show()

one_link_nodes = [n for n,k in G.degree if k==1]
G.remove_nodes_from(one_link_nodes)
# pos = nx.bipartite_layout(G,my_dictionary.keys()) # if you don't want to reuse the layout above
nx.draw(G, pos=pos, with_labels = True, node_color = 'orange')
plt.show()

结果图像：