[알고리즘] 백준 - 쉬운 최단 거리 S1 Java

package org.example.알고리즘.쉬운최단거리; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; public class Main { public static Position destination; public static int n; public static int m; public static int[][] distance; public static boolean[][] visited; public static int[][] graph; public static void main(String[] args) { try (Buffere..