Python centrality_top_20_compare Beispiele

Beispiel #1

Datei: test5.py Projekt: dhruvchamania/TSE_Final_Project

    for j in range(0, 5):
        mp[helpers.get_title(i, j)] = []
        #print(i+1,j+1)
        G1, G2, X, Y, E = noise_node_addition.noise_node_addition(
            k, l, i + 1, j + 1, 1, r'..\..\data\karate.gml')
        Y = Y / (1024 * 1024)
        #print(X,Y)
        g.append(G2)
        title.append(helpers.get_title(i, j))
        mp[helpers.get_title(i, j)].append(G2)
        mp[helpers.get_title(i, j)].append(X)
        mp[helpers.get_title(i, j)].append(Y)
        mp[helpers.get_title(i, j)].append(E)
        mp[helpers.get_title(i, j)].append(len(G2.nodes) - len(G1.nodes))
        mp[helpers.get_title(i, j)].append(
            helpers.centrality_top_20_compare(G1, G2))

sorted_time = sorted(mp.items(), key=lambda x: x[1][1])
time = {}
for i in range(len(sorted_time)):
    time[sorted_time[i][0]] = i + 1
sorted_memory = sorted(mp.items(), key=lambda x: x[1][2])
memory = {}
for i in range(len(sorted_time)):
    memory[sorted_memory[i][0]] = i + 1
sorted_error = sorted(mp.items(), key=lambda x: x[1][3])
error = {}
for i in range(len(sorted_time)):
    error[sorted_error[i][0]] = i + 1
sorted_nodes = sorted(mp.items(), key=lambda x: x[1][4])
diff_nodes = {}

Beispiel #2

Datei: test2.py Projekt: dhruvchamania/TSE_Final_Project

g = []
for i in range(0,3):
    for j in range(0,5):
        mp[helpers.get_title(i,j)] = []
        #print(i+1,j+1)
        G1,G2,X,Y,E = edge_editing.edge_editing(k,l,i+1,j+1,1,r'..\..\data\netscience.gml')
        Y = Y/(1024*1024)
        #print(X,Y)
        g.append(G2)
        title.append(helpers.get_title(i,j))
        mp[helpers.get_title(i,j)].append(G2)
        mp[helpers.get_title(i,j)].append(X)
        mp[helpers.get_title(i,j)].append(Y)
        mp[helpers.get_title(i,j)].append(E)
        mp[helpers.get_title(i,j)].append(abs(len(G2.edges) - len(G1.edges)))
        mp[helpers.get_title(i,j)].append(helpers.centrality_top_20_compare(G1,G2))

sorted_time = sorted(mp.items(), key = lambda x: x[1][1])
time = {}
for i in range(len(sorted_time)):
    time[sorted_time[i][0]] = i + 1
sorted_memory = sorted(mp.items(), key = lambda x: x[1][2])
memory = {}
for i in range(len(sorted_time)):
    memory[sorted_memory[i][0]] = i + 1
sorted_error = sorted(mp.items(), key = lambda x: x[1][3])
error = {}
for i in range(len(sorted_time)):
    error[sorted_error[i][0]] = i + 1
sorted_nodes = sorted(mp.items(), key = lambda x: x[1][4])
diff_nodes = {}