Finding shortest social connection path

{'ali': ['mo'], 'angela': ['queen', 'anna'], 'anna': [], 'dave': [], 'dog': ['liea', 'dave'], 'jimbo': [], 'lee': [], 'liea': ['lee'], 'me': ['mum', 'dog', 'teacher'], 'mo': [], 'mum': ['angela', 'liea'], 'queen': [], 'teacher': ['ali', 'jimbo']}

def find_path(start, end, graph, path=[]):    path = path + [start]    if start == end:        return path    if start not in graph:        return None    for node in graph[start]:        if node not in path:            newpath = find_path(node, end, graph, path)            if newpath:                return path    return None

>>> find_path("me", "queen", graph)['me', 'mum', 'angela', 'queen']