dfs-print.py

# prints a depth-first-search from the starting node
def dfs(node):
	visited = set()
	visited.add(node)
	stack = []
	stack.append(node)
	while len(stack) > 0:
		current = stack.pop()
		print current,
		for nodes in graph[current]:
			if nodes not in visited:
				stack.append(nodes)
				visited.add(nodes)