bfs_algor.py

import Queue

# prints a breadth-first-search from the starting node
def bfs(node):
	visited = set()
	visited.add(node)
	q = Queue.Queue()
	q.put(node)
	while not q.empty():
		current = q.get()
		for nodes in graph[current]:
			if nodes not in visited:
				print nodes, 
				q.put(nodes)
				visited.add(nodes)