Optimal_Network_Attack.py 文件源码

def Optimal_Percolation_Simultaneous_Attack(G, Centrality):
    #print "Optimal_Percolation_Simultaneous_Attack"
    Gn = G.copy()
    Ranking = Ranking_methods.Nodes_Ranking(Gn, Centrality)
    Ranking = sorted(Ranking.iteritems(), key=lambda d:d[1], reverse = True)

    Giant_Component_Size_List = []
    Component_Num_List = []
    for nid in Ranking:
        G.remove_node(nid[0])
        ### Get the Greatest Component of Networks #####
        Components = sorted(nx.connected_components(G), key = len, reverse=True)
        if len(Components) >= 1:
            Giant_Component_Size = len(Components[0])
            if Giant_Component_Size > 1:
                Giant_Component_Size_List.append(Giant_Component_Size)
                Component_Num_List.append(len(Components))
    #end for
    return Giant_Component_Size_List,Component_Num_List

#************************************************************************