NePA TesT: Community Network Emulator

#!/usr/bin/env python

import networkx as nx

import sys

from matplotlib import pyplot as plt

from pprint import pprint

import sys

import code

fname=sys.argv[1]

if(fname.endswith(".edges")):

    g = nx.read_weighted_edgelist(fname)

elif(fname.endswith(".graphml")):

    g = nx.read_graphml(fname, node_type=int)

loads=nx.load_centrality(g,normalized=False,weight='weight')

g.remove_edges_from(g.selfloop_edges())

c = nx.k_core(g, 2)

a = [n for n in nx.articulation_points(c)]

fail_candidates = [ n for n in c.nodes() if n not in a]

toFails={}

for n in fail_candidates:

    gg = g.copy()

    gg.remove_node(n)

    comp = list(nx.connected_components(gg))

    #print n

    #pprint(comp)

    isolated_nodes = [x for component in comp[1:] for x in component]

    #code.interact(local=dict(globals(), **locals()))

    #print "XX", isolated_nodes

    if (len(isolated_nodes)==0):

            if (loads[n]>0):

                    toFails[n]=loads[n]

#pprint(sorted(toFails.items(), key=lambda x:x[1], reverse=True))

print fname, "size: ",len(g.nodes())

for e in sorted(toFails.items(), key=lambda x:x[1], reverse=True):

        sys.stdout.write(str(e[0])+",")

print ""

print "#nf", len(toFails)

'''nx.draw(g)

plt.show()

nx.draw(c)

plt.show()'''