Feat: add 플로이드

letsjo · letsjo · commit e41433db8098 · 2023-10-23T00:06:12.000+09:00
diff --git a/baekjoon/11404.js b/baekjoon/11404.js
@@ -14,26 +14,25 @@ const N = Number(input[0]);
 const M = Number(input[1]);
 const fees = input.slice(2).map((val) => val.split(' ').map(Number));
 
-const INF = 100001;
-const graph = Array.from(Array(N + 1), () => Array(N + 1).fill(INF));
-
-for (let i = 1; i <= N; i++) {
-  graph[i][i] = 0;
-}
+const graph = Array.from(Array(N + 1), () => Array(N + 1).fill(Infinity));
 
 for (let i = 0; i < M; i++) {
   const [a, b, c] = fees[i];
 
   graph[a][b] = Math.min(graph[a][b], c);
 }
 
+for (let i = 1; i <= N; i++) {
+  graph[i][i] = 0;
+}
+
 // k: &#44144;&#52432;&#44032;&#45716; &#45432;&#46300;, i: &#52636;&#48156; &#45432;&#46300;, j: &#46020;&#52265; &#45432;&#46300;
 for (let k = 1; k <= N; k++) {
   for (let i = 1; i <= N; i++) {
     for (let j = 1; j <= N; j++) {
       const originalRouteCost = graph[i][j];
       const newRouteCost = graph[i][k] + graph[k][j];
-      graph[i][j] = Math.min(originalRouteCost, newRouteCost);
+      if (originalRouteCost > newRouteCost) graph[i][j] = newRouteCost;
     }
   }
 }
@@ -42,7 +41,7 @@ let answer = '';
 
 for (let i = 1; i <= N; i++) {
   for (let j = 1; j <= N; j++) {
-    if (graph[i][j] === INF) {
+    if (graph[i][j] === Infinity) {
       answer += '0 ';
     } else {
       answer += `${graph[i][j]} `;
