这个题目的测试用例是不全面的,应该要加上优先队列去判断7,7,[[1,3,2],[1,4,5],[2,5,1],[3,2,1],[3,5,4],[4,5,5],[6,7,5]] import sys class Solution: def findShortestPath(self, n, m, graph): # 创建一个表示图的字典 dic = {} for i in range(1,n+1): dic[i] = {} # 创建图 for v in graph: ...