Graph | Python Fiddle

# BFS

class Vertex:
    def __init__(self, key):
        self.id = key
        self.adjacent = {}
        
    def addNeighbor(self, nbr, weight=0):
        self.adjacent[nbr] = weight
        
    def __str__(self):
        return str(self.id) + ' connectedTo: ' + str([x.id for x in self.adjacent])
    
    def getAdjacent(self):
        return self.adjacent.keys()
    
    def getId(self):
        return self.id
    
    def getWeight(self, nbr):
        return self.connectedTo[nbr]
    
class Graph:
    def __init__(self):
        self.vertList = {}
        self.numVertices = 0
        
    def addVertex(self, key):
        self.numVertices = self.numVertices + 1
        newVertex = Vertex(key)
        self.vertList[key] = newVertex
        return newVertex
    
    def getVertex(self, n):
        if n in self.vertList:
            return self.vertList[n]
        else:
            return None
        
    def __contains__(self, n):
        return n in self.vertList
    
    def addEdge(self, f, t, cost=0):
        if f not in self.vertList:
            nv = self.addVertex(f)
        if t not in self.vertList:
            self.addVertex(t)
        self.vertList[f].addNeighbor(self.vertList[t], cost)
        
    def getVertices(self):
        return self.vertList.keys()
    
    def __iter__(self):
        return iter(self.vertList.values())
    
if __name__ == ' __main__ ':
    g = Graph()
    for i in range(6):
        g.addVertex(i)
    
    print g.vertList
    
    g.addEdge()

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE