Make this code for DFS Shortest Path for same graph

def bfs_shortest_path(graph, start, goal): explored = [] queue = [[start]] if start == goal: return "Start = goal" while queue: path = queue.pop(0) node = path[-1] if node not in explored: neighbours = graph[node] for neighbour in neighbours: new_path = list(path) new_path.append(neighbour) queue.append(new_path) if neighbour == goal: return new_path explored.append(node) return "Connecting path doesn't exist" graph = {'S': ['1', '2'], '1': ['S', '3'], '2': ['S', '3', '4'], '3': ['1', '2', '5'], '4': ['2'], '5': ['3']}