pedWorks.py 文件源码

def calculate_eigenvector_centrality(graph):
    print "\n\tCalculating Eigenvector Centrality..."
    g = graph
    ec = nx.eigenvector_centrality_numpy(g)
    nx.set_node_attributes(g, 'eigenvector', ec)
    degeign_sorted = sorted(ec.items(), key=itemgetter(1), reverse=True)
    for key, value in degeign_sorted[0:10]:
        print "\t   > ", key, round(value, 4)

    return g, ec