Merge pull request #20 from aroragarima/master

errors corrected

Author: wblakecannon

21-network-analysis-in-python-(part-1)/02-important-nodes/02-compute-degree-distribution.py

@@ -12,7 +12,7 @@
 Print the degrees.
 '''
 # Compute the degree of every node: degrees
-degrees = [len(T.neighbors(n)) for n in T.nodes()]
+degrees = [len(list(T.neighbors(n))) for n in T.nodes()]
 
 # Print the degrees
 print(degrees)

21-network-analysis-in-python-(part-1)/02-important-nodes/03-degree-centrality-distribution.py

@@ -27,10 +27,10 @@
 
 # Plot a histogram of the degree distribution of the graph
 plt.figure()
-plt.hist([len(T.neighbors(n)) for n in T.nodes()])
+plt.hist([len(list(T.neighbors(n))) for n in T.nodes()])
 plt.show()
 
 # Plot a scatter plot of the centrality distribution and the degree distribution
 plt.figure()
 plt.scatter(degrees, list(deg_cent.values()))
-plt.show()
+plt.show()