anomit · September 2, 2009 12:16
diff --git a/gistfile1.py b/gistfile1.py
 """
 Sorting nodes of a graph according to their degrees
 Idea from: http://mail.python.org/pipermail/python-list/2002-July/152876.html
 """

 #example adjacency list
 adjlist = {'a':['b','c','d'],'b':['a','d'],'c':['a'],'d':['b','a']}

 histogram = [ (len(value), key) for key, value in adjlist.iteritems() ]
 histogram.sort()
	"""
	Sorting nodes of a graph according to their degrees
	Idea from: http://mail.python.org/pipermail/python-list/2002-July/152876.html
	"""

	#example adjacency list
	adjlist = {'a':['b','c','d'],'b':['a','d'],'c':['a'],'d':['b','a']}

	histogram = [ (len(value), key) for key, value in adjlist.iteritems() ]
	histogram.sort()