import networkx as nx
dat = {'0': [[0, 2],[1, 2],
[3, 4],[5, 6]],
'1': [[1, 6],[2, 6],
[3, 4],[0, 3],[2, 4]],
# adding a graph with two triangles
'2': [[0,1],[1,2],
[2,0],[3,4],
[4,5],[5,3]]}
graphs = {key:nx.from_edgelist([(v[0],v[1]) for v in value]) for key,value in dat.items()}
# count number of triangles per node
node_triangle_counts = {key:nx.triangles(graph) for key,graph in graphs.items()}
print(node_triangle_counts)
# {'0': {0: 0, 2: 0, 1: 0, 3: 0, 4: 0, 5: 0, 6: 0},
# '1': {1: 0, 6: 0, 2: 0, 3: 0, 4: 0, 0: 0},
# '2': {0: 1, 1: 1, 2: 1, 3: 1, 4: 1, 5: 1}}
# sum the node counts and divide by three because each triangle is counted for all three nodes in the triangle
num_triangles_per_graph = {key:sum(val_dict.values()) / 3
for key,val_dict in node_triangle_counts.items()}
# {'0': 0, '1': 0, '2': 2}
在您提供的数据中,您的数据实际上没有任何三角形(三个节点上的完整子图),但下面是一个示例,其中包含一个附加的边列表。注意,
networkx.from_edgelist
函数接受一个edgelist作为元组列表,而不是列表列表,因此我不得不更改它们。networkx.triangles
函数返回由每个节点键入的字典,该字典提供使用此节点的三角形计数。我们可以将该dict的值求和并除以3来确定三角形的实际数目see docs相关问题 更多 >
编程相关推荐