Floyd最短路

def solve(____):
    n = int(____)
    dist = [[float(____)] * n for _ in range(____)]
    for i in range(____):
        dist[i][i] = ____
    for e in edges.split(____):
        u, v, w = map(int, e.split(____))
        dist[u][v] = w
        dist[v][u] = w
    for k in range(____):
        for i in range(____):
            for j in range(____):
                dist[i][j] = min(____)
    print(____)