degree_sequence_tree# degree_sequence_tree(deg_sequence, create_using=None)[源]# 根据给定的度序列生成一棵树。 一棵树满足 #节点-#边=1,因此度序列必须满足 len(deg_sequence)-sum(deg_sequence)/2=1