Introduction to the Modeling and Analysis of Complex Systems

16.3. SIMULATING DYNAMICS OF NETWORKS 357With this preferential node selection function, the completed simulation code looks likethis:Code 16.12: barabasi-albert.pyimport matplotlibmatplotlib.use(’TkAgg’)from pylab import *import networkx as nxm0 = 5 # number of nodes in initial conditionm = 2 # number of edges per new nodedef initialize():global gg = nx.complete_graph(m0)g.pos = nx.spring_layout(g)g.count = 0def observe():global gcla()nx.draw(g, pos = g.pos)def pref_select(nds):global gr = uniform(0, sum(g.degree(i) for i in nds))x = 0for i in nds:x += g.degree(i)if r