Commit 8c8995a

authored

Update Chapter 2 - Important nodes.py

1 parent 72877d8 commit 8c8995aCopy full SHA for 8c8995a

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,7 +15,7 @@ def nodes_with_m_nbrs(G, m):`
`15`	`15`	`for n in G.nodes():`
`16`	`16`
`17`	`17`	`# Check if the number of neighbors of n matches m`
`18`		`- if len(G.neighbors(n)) == m:`
	`18`	`+ if len(list(G.neighbors(n))) == m:`
`19`	`19`
`20`	`20`	`# Add the node n to the set`
`21`	`21`	`nodes.add(n)`
`@@ -31,7 +31,7 @@ def nodes_with_m_nbrs(G, m):`
`31`	`31`	`#---------=======================================================--------------%`
`32`	`32`	`#Compute degree distribution`
`33`	`33`	`# Compute the degree of every node: degrees`
`34`		`-degrees = [len(T.neighbors(n)) for n in T.nodes()]`
	`34`	`+degrees = [len(list(T.neighbors(n))) for n in T.nodes()]`
`35`	`35`
`36`	`36`	`# Print the degrees`
`37`	`37`	`print(degrees)`
`@@ -249,4 +249,4 @@ def find_node_with_highest_bet_cent(G):`
`249`	`249`
`250`	`250`
`251`	`251`
`252`		`-#---------=======================================================--------------%`
	`252`	`+#---------=======================================================--------------%`

Comments

(0)