JavaScriptでワーシャルフロイド法を実装

N M
a1 b1 t1
a2 b2 t2
:
aM bM tM

3 2
1 2 10
2 3 10

"use strict"
function main(arg) {
    let tmp = arg.trim().split("\n").map(e => e.split(" ").map(Number))
    const V = tmp[0][0]
    const E = tmp[0][1]
    tmp.shift()
    let data = tmp

    const MAX = 10e9;
    let graph = Array.from(new Array(V), () => new Array(V).fill(MAX));

    for (let i = 0; i < data.length; i++) {
        let a = data[i][0] - 1
        let b = data[i][1] - 1
        let t = data[i][2]
        graph[a][b] = t
        graph[b][a] = t
    }
    
    // ワーシャルフロイド
    for (let k = 0; k < V; k++) {
        for (let i = 0; i < V; i++) {
            for (let j = 0; j < V; j++) {
                graph[i][j] = Math.min(graph[i][j], graph[i][k] + graph[k][j])
                if (i === j) {
                    graph[i][j] = 0
                }
            }
        }
    }

    // console.log(JSON.stringify(graph,null,' '));

    let ans = 10e9;
    let max_temp = 0;

    for (let i = 0; i < V; i++) {
        for (let j = 0; j < V; j++) {
            if (max_temp < graph[i][j]) {
                max_temp = graph[i][j];
            }
        }
        if (ans > max_temp) {
            ans = max_temp;
        }
        max_temp = 0;
    }

    console.log(ans);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));

3 2
1 2 10
2 3 10

[[20,10,20],[10,20,10],[20,10,20]]