1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
#!/usr/bin/env python
"""
Compute some network properties for the lollipop graph.
"""
# Copyright (C) 2004 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
# Distributed under the terms of the GNU Lesser General Public License
# http://www.gnu.org/copyleft/lesser.html
from networkx import *
G = lollipop_graph(4,6)
pathlengths=[]
print "source vertex {target:length, }"
for v in G.nodes():
spl=single_source_shortest_path_length(G,v)
print v,spl
for p in spl.values():
pathlengths.append(p)
print
print "average shortest path length ", sum(pathlengths)/len(pathlengths)
# histogram of path lengths
dist={}
for p in pathlengths:
if dist.has_key(p):
dist[p]+=1
else:
dist[p]=1
print
print "length #paths"
verts=dist.keys()
verts.sort()
for d in verts:
print d,dist[d]
print "radius: ",radius(G)
print "diameter: ",diameter(G)
print "eccentricity: ",eccentricity(G,with_labels=True)
print "center: ",center(G)
print "periphery: ",periphery(G)
print "density: ", density(G)
|