Commit f6208c4

authored

Merge pull request #6 from shadab-entrepreneur/patch-2

Update Chapter 4 - Bringing it all together.py

2 parents c7bcf28 + 440b4b2 commit f6208c4Copy full SHA for f6208c4

File tree

-5

lines changed

-5

lines changed

Lines changed: 5 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -140,17 +140,17 @@`
`140`	`140`	`# Import necessary modules`
`141`	`141`	`from nxviz import ArcPlot`
`142`	`142`	`import matplotlib.pyplot as plt`
`143`		`-`
	`143`	`+`
`144`	`144`	`# Identify the largest maximal clique: largest_max_clique`
`145`	`145`	`largest_max_clique = set(sorted(nx.find_cliques(G), key=lambda x: len(x))[-1])`
`146`	`146`
`147`	`147`	`# Create a subgraph from the largest_max_clique: G_lmc`
`148`		`-G_lmc = G.subgraph(largest_max_clique)`
	`148`	`+G_lmc = G.subgraph(largest_max_clique).copy()`
`149`	`149`
`150`	`150`	`# Go out 1 degree of separation`
`151`		`-for node in G_lmc.nodes():`
	`151`	`+for node in list(G_lmc.nodes()):`
`152`	`152`	`G_lmc.add_nodes_from(G.neighbors(node))`
`153`		`- G_lmc.add_edges_from(zip([node]*len(G.neighbors(node)), G.neighbors(node)))`
	`153`	`+ G_lmc.add_edges_from(zip([node]*len(list(G.neighbors(node))), G.neighbors(node)))`
`154`	`154`
`155`	`155`	`# Record each node's degree centrality score`
`156`	`156`	`for n in G_lmc.nodes():`
`@@ -209,4 +209,4 @@`
`209`	`209`
`210`	`210`
`211`	`211`
`212`		`-#---------=======================================================--------------%`
	`212`	`+#---------=======================================================--------------%`

Comments

(0)