Calculating centrality with networkx

README.md

See here: http://networkx.lanl.gov/reference/algorithms.centrality.html for a list of centrality algorithms implemented in networkx

centrality.py

import networkx as nx

# this is a directed graph
dg=nx.DiGraph()

# For all the nodes ...
# this adds a node to the graph
#  - node could be any hashable object
#  - attr_dict is an (optional) dictionary with attributes for the node
dg.add_node(node, attr_dict)

# For all edges ...
# this adds an edge from source to target
#  - source, target could be any hashable object
#  - attr_dict is an (optional) dictionary with attributes for the edge
dg.add_edge(source, target, attr_dict)

# This returns a dictionary { node => centrality value }
centrality_dict = nx.betweenness_centrality(dg)