Simple python NetworkX centrality- graph calculations

IT & Networking Other - IT & Networking Posted 1 year ago

Fixed Price

Delivery by January 11, 2014




Take the NetworkX python modules readily available on the web:

Take as input pairs of nodes in format [node, node]

return results in .txt file
The output should look like a sorted list of highest to lowest ASes for betwenness centrality.



#!/usr/bin/env python
Centrality measures

from networkx import *


for v in G.nodes():
    print("%0.2d %5.3f"%(v,b[v]))

print("Degree centrality")
for v in G.nodes():
    print("%0.2d %5.3f"%(v,d[v]))

print("Closeness centrality")
for v in G.nodes():
    print("%0.2d %5.3f"%(v,c[v]))

That is the first job, just betweenness_centrality

Then if successful also:

1) Total nodes and links
2) Average degree
3) Clustering coefficient
4) Assortativity
5) Radius and diameter
6) Average path length
7) Connected components
8) Modularity

Open Attachment

Skills Required:

Client Activity on this Job

Last Viewed: 1 year ago

Applicants: 2

Hired: 1

About the Client

(4.89) 7 reviews

United States
Cambridge 11:13 PM

15 Jobs Posted
60% Hire Rate, 1 Open Job

$208 Total Spent
13 Hires, 0 Active

$16.67/hr Avg Hourly Rate Paid
5 Hours

Member Since Jul 18, 2013