#coding:utf-8
import?networkx?as?nx
import?math
import?csv
import?random?as?rand
import?sys
import?matplotlib.pyplot?as?plt

def?buildG（G?file_?delimiter_）:
????reader?=?csv.reader（open（file_）?delimiter=delimiter_）
????for?line?in?reader:
????????if?int（line[2]）?!=?0:
????????????G.add_weighted_edges_from（[（line[0]line[1]int（line[2]））]）

def?CmtyStep（G）:
????init_number_comp?=?nx.number_connected_components（G）
????print?‘init?:?%d‘%init_number_comp
????number_comp?=?init_number_comp
????while?number_comp?<=?init_number_comp:
????????bw?=?nx.edge_betweenness_centrality（G）??#?edge?betweenness?for?G
????????#?find?the?edge?with?max?centrality
????????max_?=?0.0
????????#?find?the?edge?with?the?highest?centrality?and?remove?all?of?them?if?there?is?more?than?one!
????????for?k?v?in?bw.iteritems（）:
????????????#?print?v
????????????_BW?=?float（v）?/?float（G[k[0]][k[1]][‘weight‘]）???#?weighted?version?of?betweenness
????????????if?_BW?>=?max_:
????????????????max_?=?_BW
????????for?k?v?in?bw.iteritems（）:
????????????if?float（v）?/?float（G[k[0]][k[1]][‘weight‘]）??==?max_:
????????????????#?print?“remove?an?edge!“
????????????????#?print?k
????????????????G.remove_edge（k[0]?k[1]）??#?remove?the?central?edge
????????number_comp?=?nx.number_connected_components（G）??#?recalculate?the?no?of?components

def?GetModularity（G?deg_?m_）:
????New_A?=?nx.adj_matrix（G）#建立一個表示邊的鄰接矩陣
????New_deg?=?{}
????New_deg?=?UpdateDeg（New_A?G.nodes（））
????#計算Q值
????comps?=?nx.connected_components（G）#建立一個組成的列表
????print?‘Number?of?communities?in?decomposed?G:?%d‘?%?nx.number_connected_components（G）
????Mod?=?0#設定社團劃分的模塊化系數并設初始值為0
????for?c?in?comps:
????????AVW?=?0#兩條邊在鄰接矩陣中的值
????????K?=?0#兩條邊的度值
????????for?u?in?c:
????????????AVW?+=?New_deg[u]
????????????K?+=?deg_[u]
????????Mod?+=?（?float（AVW）?-?float（K*K）/float（2*m_）?）#計算出Q值公式累加符號后的值
????Mod?=?Mod/float（2*m_）#計算出模塊化Q值
????return?Mod

def?