from networkx.generators.degree_seq import random_degree_sequence_graph
from networkx.algorithms.graphical import is_graphical
from networkx.utils.random_sequence import powerlaw_sequence
n, t = 10, 2
while True: # Continue generating sequences until one of them is graphical
seq = sorted([int(round(d)) for d in powerlaw_sequence(n, t)], reverse=True) # Round to nearest integer to obtain DISCRETE degree sequence
if is_graphical(seq):
break
G = random_degree_sequence_graph(seq, tries=100) # Adjust number of tries as you see fit
print(sorted(d for _, d in G.degree()))
您可以使用
networkx
来实现这一点。is_graphical
函数允许您确定powerlaw_sequence
函数的结果是否为有效的度序列。一旦我们生成了一个有效的序列,我们就可以从中创建一个随机图相关问题 更多 >
编程相关推荐