python最短路径算法如何选择

#!/usr/bin/python3

# coding=utf-8

my_max = 0xffff

def Dijkstra(v, G, d, vis, n):

    # 自身到自身为0

    d[v] = 0

    for i in range(n):

        u = -1

        my_min = my_max

        for j in range(n):

            if vis[j] == False and d[j] < my_min:

                u, my_min = j, d[j]

        if u == -1:

            return

        vis[u] = True

        for s in range(n):

            if vis[s] == False and G[u][s] != my_max and d[u] + G[u][s] < d[s]:

                d[s] = d[u] + G[u][s]

def mian():

    n, edges, v = map(int, input('请输入图的节点个数,边个数和起始点:').split())

    # n = 3

    # edges = 3

    d = [my_max for t in range(n)]

    vis = [False for i in range(n)]

    G = []

    # G = [[my_max, 1, my_max], [1, my_max, 3], [my_max, 3, my_max]]

    for j in range(n):

        G.append([my_max for t in range(n)])

    for i in range(edges):

        node1, node2, edge_node = map(int, input('请输入请输入两个节点和中间的边:').split())

        G[node1][node2] = edge_node

        G[node2][node1] = edge_node

    Dijkstra(v, G, d, vis, n)

    for i in range(len(d)):

        print('节点%d到节点%d的最短距离是：%d' % (v, i, d[i]))

if __name__ == '__main__':

    mian()