Graph Representation In Python. Key is vertice name and value is set of neighbouring vertices.

graph_dict.py

graph = {'A' : set(['G','B']),
         'B' : set(['C','D','A']),
         'C' : set(['F','D','B']),
         'D' : set(['B','C']),
         'E' : set(['F']),
         'F' : set(['E','C']),
         'G' : set(['A']),
        }
print graph

##Output should be {'A': set(['B', 'G']), 'C': set(['B', 'D', 'F']), 
##  'B': set(['A', 'C', 'D']), 'E': set(['F']), 'D': set(['C', 'B']), 
##  'G': set(['A']), 'F': set(['C', 'E'])}