Centrality
==========

>>> from networkx import *
>>> G=krackhardt_kite_graph()

Betweenness
-----------

>>> b=betweenness_centrality(G)
>>> for v in G.nodes():
...     print "%0.2d %5.3f"%(v,b[v])
00 0.023
01 0.023
02 0.000
03 0.102
04 0.000
05 0.231
06 0.231
07 0.389
08 0.222
09 0.000

>>> b=betweenness_centrality(G,normalized=False)
>>> for v in G.nodes():
...     print "%0.2d %5.3f"%(v,b[v])
00 1.667
01 1.667
02 0.000
03 7.333
04 0.000
05 16.667
06 16.667
07 28.000
08 16.000
09 0.000

Degree Centrality
------------------

>>> d=degree_centrality(G)
>>> for v in G.nodes():
...     print "%0.2d %5.3f"%(v,d[v])
00 0.444
01 0.444
02 0.333
03 0.667
04 0.333
05 0.556
06 0.556
07 0.333
08 0.222
09 0.111

Closeness Centrality
--------------------

>>> c=closeness_centrality(G)
>>> for v in G.nodes():
...     print "%0.2d %5.3f"%(v,c[v])
00 0.529
01 0.529
02 0.500
03 0.600
04 0.500
05 0.643
06 0.643
07 0.600
08 0.429
09 0.310

>>> GG=path_graph(3)
>>> b=betweenness_centrality(GG,normalized=False)
>>> for v,bb in b.items():
...     print "%s %s"%(v,bb)
0 0.0
1 2.0
2 0.0

>>> b=betweenness_centrality(GG,normalized=True)
>>> for v,bb in b.items():
...     print "%s %s"%(v,bb)
0 0.0
1 1.0
2 0.0


Edge Betweenness
----------------

FIXME: untested