find shortest path in graph

shortest_path.py

import deque

graph2 = {
    'Dov Aharon': ['Debbie Ben Zaken', 'Yaron Baberman'],
    'Debbie Ben Zaken': [],
    'Yaron Baberman': ['Dan Cohen'],
    'Dan Cohen': ['David Dukovsky', 'Didi Eshkol'],
    'David Dukovsky': [], 'Didi Eshkol': []
}

def find_path(graph, start, end):
    path = {start: [start]}
    queue = deque([start])

    while len(queue):
        at = queue.popleft()
        for next in graph[at]:
            if next not in path:
                path[next] = [path[at], next]
                queue.append(next)
    return path.get(end)