플로이드 워셜 알고리즘

4
7
1 2 4
1 4 6
2 1 3
2 3 7
3 1 5
3 4 4
4 3 2

import java.io.BufferedReader
import java.io.BufferedWriter
import java.io.InputStreamReader
import java.io.OutputStreamWriter
import java.lang.Integer.min
import java.util.*
 
val br = BufferedReader(InputStreamReader(System.`in`))
val bw = BufferedWriter(OutputStreamWriter(System.out))
val n = readLine()!!.toInt()
val m = readLine()!!.toInt()
val graph = Array(n+1,{IntArray(n+1,{1e9.toInt()})})
 
fun main()=with(br){
    for(i in 1 until n+1){
        for(j in 1 until n+1){
            if(i==j){
                graph[i][j]=0
            }
        }
    }
    for(i in 0 until m){
        var(a,b,c)=readLine()!!.split(" ").map{it.toInt()}
        graph[a][b]=c
    }
    for(i in 1 until n+1){
        for(j in 1 until n+1){
            for(k in 1 until n+1){
                graph[j][k]=min(graph[j][k],graph[j][i]+graph[i][k])
            }
        }
    }
    for(i in 1 .. n){
        for(j in 1 .. n) {
            if (graph[i][j] == 1e9.toInt()) {
                print("INFINITY ")
            } else {
                print("${graph[i][j]} ")
            }
        }
        println()
    }
    bw.flush()
    bw.close()
}