Results

• Python Patterns - Implementing Graphs

  ...Breadth First Search]. Furthermore a linear BFS is simpler:" # Code by Eryk Kopczyński def find_shortest_path(graph, start, end): dist = {start: [start]} q = deque(start) while len(q): at = q.popleft() for next in graph[at]: if next not in dist: dist[next] = [dist[at], next] q.append(next) return dist.get(end) Note that this returns the path in a weird form...

Python language documentation

If you didn't find what you need, try your search in the Python language documentation.