Python 백준 알고리즘 11404 : 플로이드

https://www.acmicpc.net/problem/11404

11404번: 플로이드

 

# 11404 플로이드

n = int(input())
m = int(input())
INF = int(1e9)
graph = [[INF] * (n) for i in range(n)]

for _ in range(m):
  i, j, cost = map(int, input().split())
  if graph[i-1][j-1] > cost:
    graph[i-1][j-1] = cost

for k in range(n):
  for i in range(n):
    for j in range(n):
      if i == j:
        continue
      graph[i][j] = min(graph[i][j], graph[i][k]+graph[k][j])

for i in range(n):
  for j in range(n):
    if graph[i][j] == INF:
      graph[i][j] = 0

for i in range(n):
  print(*graph[i])