Graph Traversal in Python

graph = {    5: [3, 7],    3: [2, 1],    7: [8],    2: [],    1: [],    8: []}

def bfs(graph, node, path=[]):    queue = [node]    while queue:        node = queue.pop(0)        if node not in queue:            path.append(node)            for neighbour in graph[node]:                queue.append(neighbour)    return path

>>> bfs(graph, 5)    [5, 3, 7, 2, 1, 8]

def dfs(graph, node, path=[]):    queue = set()    if node not in queue:        queue.add(node)        path.append(node)        for neighbour in graph[node]:            path = dfs(graph, neighbour)    return path

>>> dfs(graph, 5)    [5, 3, 2, 1, 7, 8]