Python Graph.breadth_first_search Examples

Example #1

File: run.py Project: gawaineo/python-ds-and-algorithms

g.addEdge('C', 'F')
g.addEdge('C', 'S')
g.addEdge('D', 'C')
g.addEdge('E', 'H')
g.addEdge('E', 'C')
g.addEdge('F', 'G')
g.addEdge('F', 'C')
g.addEdge('G', 'H')
g.addEdge('G', 'F')
g.addEdge('G', 'S')
g.addEdge('H', 'E')
g.addEdge('H', 'G')


print "Number of vertices: ", g.numVertices
results = Graph.breadth_first_search(g, g.getVertex('A'))

for i in results:
   print i.getId()

#----------------WORKING-------------#
# g = Graph.Graph()
# for i in range(6):
#     g.addVertex(i)
#
# print g.vertList
#
# g.addEdge(0, 1, 5)
# g.addEdge(0, 5, 2)
# g.addEdge(1,2,4)
# g.addEdge(2,3,9)