From 4ec691e6470e666ff0f274377bf600e680e0d7d0 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Mon, 6 Oct 2025 15:17:09 +0900
Subject: [PATCH] =?UTF-8?q?[20251006]=20BOJ=20/=20G4=20/=20=EC=9A=B4?=
 =?UTF-8?q?=EB=8F=99=20/=20=EC=9D=B4=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../06 BOJ G4 \354\232\264\353\217\231.md"    | 52 +++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 "JHLEE325/202510/06 BOJ G4 \354\232\264\353\217\231.md"

diff --git "a/JHLEE325/202510/06 BOJ G4 \354\232\264\353\217\231.md" "b/JHLEE325/202510/06 BOJ G4 \354\232\264\353\217\231.md"
new file mode 100644
index 00000000..db1c69c7
--- /dev/null
+++ "b/JHLEE325/202510/06 BOJ G4 \354\232\264\353\217\231.md"	
@@ -0,0 +1,52 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static final int INF = 987654321;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        int v = Integer.parseInt(st.nextToken());
+        int e = Integer.parseInt(st.nextToken());
+
+        int[][] map = new int[v][v];
+
+        for (int i = 0; i < v; i++) {
+            Arrays.fill(map[i], INF);
+        }
+
+        for (int i = 0; i < e; i++) {
+            st = new StringTokenizer(br.readLine());
+            int s = Integer.parseInt(st.nextToken()) - 1;
+            int d = Integer.parseInt(st.nextToken()) - 1;
+            int c = Integer.parseInt(st.nextToken());
+
+            map[s][d] = c;
+        }
+
+        for (int k = 0; k < v; k++) {
+            for (int i = 0; i < v; i++) {
+                for (int j = 0; j < v; j++) {
+                    map[i][j] = Math.min(map[i][j], map[i][k] + map[k][j]);
+                }
+            }
+        }
+        int res = INF;
+        for (int i = 0; i < v; i++) {
+            for (int j = 0; j < v; j++) {
+                res = Math.min(res, map[i][j] + map[j][i]);
+            }
+        }
+
+        if (res == INF) {
+            System.out.println(-1);
+        } else {
+            System.out.println(res);
+        }
+    }
+}
+```