【BFS题型三/简单图/打印所有指定路径】

剑指 Offer II 110. 所有路径

class Solution(object):
    def allPathsSourceTarget(self, graph):
        """
        :type graph: List[List[int]]
        :rtype: List[List[int]]
        """
        def bfs():
            n=len(graph)
            queue = deque([[0]])
            a=[]
            while queue:
                p = queue.popleft()
                nodes=graph[p[-1]]
                for w in graph[p[-1]]:
                    if w==n-1:
                        a.append(p+[n-1])
                    else:
                        queue.append(p+[w])
            return a
        a=bfs()
        return a