An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1
) is given as graph
.
graph.length = N
, and j != i
is in the list graph[i]
exactly once, if and only if nodes i
and j
are connected.
Return the length of the shortest path that visits every node. You may start and stop at any node, you may revisit nodes multiple times, and you may reuse edges.
Example 1:
Input: [[1,2,3],[0],[0],[0]] Output: 4 Explanation: One possible path is [1,0,2,0,3]
Example 2:
Input: [[1],[0,2,4],[1,3,4],[2],[1,2]] Output: 4 Explanation: One possible path is [0,1,4,2,3]
Note:
1 <= graph.length <= 12
0 <= graph[i].length < graph.length
数据范围只有12,暴力应该OK
最开始以为直接BFS会死循环,仔细想想并不会,只是会把搜索空间变得越来越大,何况还可以记录状态剪枝
class Solution:
def shortestPathLength(self, g):
"""
:type graph: List[List[int]]
:rtype: int
"""
if len(g)==1: return 0
step=1
q,qq=[(i,1<<i) for i in range(len(g))],[]
vis = set(q)
while q:
while q:
i,s=q.pop()
if s==((1<<len(g))-1): return step-1
for t in g[i] :
if (t,s|(1<<t)) not in vis:
qq.append((t,s|(1<<t)))
vis.add((t,s|(1<<t)))
q,qq=qq,q
step+=1