def test_calBetweenness(self): #test on lecture example edges = network_lecture() bl = cb.calBetweenness(edges,1) self.assertEqual(bl, [[0,2,2,0,0],[2,0,0,1,0],[2,0,0,1,0],[0,1,1,0,1],[0,0,0,1,0]]) bl = cb.calBetweenness(edges,2) #self.assertEqual(bl, [[0,1.5,0.5,0,0],[1.5,0,0,2.5,0],[0.5,0,0,0.5,0],[0,2.5,0.5,0,1],[0,0,0,1,0]]) self.assertEqual(bl, [[0,3.5,2.5,0,0],[3.5,0,0,3.5,0],[2.5,0,0,1.5,0],[0,3.5,1.5,0,2],[0,0,0,2,0]])
edges = {} for n in range(N): edges[n] = [] # connect two neighbors each side edges[n].append( (n+1) % N ) edges[n].append( (n+2) % N ) edges[n].append( (n-1) % N ) edges[n].append( (n-2) % N ) # print edge list #print(edges) #visGraph(edges, N) # calculate betweenness before rewiring bl = cb.calBetweenness(edges) # rewiring probability p = 0.1 print('rewiring probability: ' + str(p)) # store short cut edges that has been rewired shortCutEdges = [[0 for x in range(N)] for x in range(N)] shortCutCounts = 0 # for each node for n in range(N): # for each of its one side edges (2 edges): for e in range(2): # check rewiring probability