Skip to content

Instantly share code, notes, and snippets.

@amankharwal

amankharwal/graph algorithms Secret

Created October 9, 2020 07:25
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save amankharwal/d3b4924b7d01f15244b8b05861829cde to your computer and use it in GitHub Desktop.
Save amankharwal/d3b4924b7d01f15244b8b05861829cde to your computer and use it in GitHub Desktop.
Download ZIP
Raw
graph algorithms
pos = nx.spring_layout(subgraph_3437)
betweennessCentrality = nx.betweenness_centrality(subgraph_3437,normalized=True, endpoints=True)
node_size = [v * 10000 for v in betweennessCentrality.values()]
plt.figure(figsize=(20,20))
nx.draw_networkx(subgraph_3437, pos=pos, with_labels=False,
node_size=node_size )
plt.axis('off')
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment