我想使这种dijkstra算法从文本文件（vertices.txt）中获取“ testedges”的输入，所以我希望“ testedges = myedges”能够正常工作，并让用户输入他想知道的两个顶点之间的最短路径，因此我需要使用input（），而不要像下面完整代码中所示的那样手动在代码中编写两个节点。

完整代码：

from collections import defaultdict
from heapq import *

def dijkstra(edges, f, t):
  

    return float("inf")
if __name__ == "__main__":
    testedges = [
        ("A", "B", 7),
        ("A", "D", 5),
        ("B", "C", 8),
        ("B", "D", 9),
        ("B", "E", 7),
        ("C", "E", 5),
        ("D", "E", 15),
        ("D", "F", 6),
        ("E", "F", 8),
        ("E", "G", 9),
        ("F", "G", 11)
    ]

    print("=== Dijkstra ===")
    print (testedges)
    print ("A -> E:")
    print (dijkstra(testedges, 'A', 'E'))
    print ("F -> G:")
    print (dijkstra(testedges, "F", "G"))

我想要的调整是：

testedges = myedges        # meanning that I want the edges to come straight from the .txt file 
print (input() ,"->" ,input()) # get the shortest path for the two nodes user chooses
 print (dijkstra(myedges, input(), input()) 

.txt是以这种方式格式化的

4,3,10 // i, j, k tells you that there is an edge between vi and vj and its 
          weight is k.
2,1,4  // v1,v2,5 and so on for the rest 
1,3,2
3,4,3
0,2,30

笔记：