static/chunks/766-12dbb05e2adf85ab.js","4150","static/chunks/app/courses/%5BcourseSlug%5D/lessons/%5BunitSlug%5D/page-1fc213a0f4568bd8.js"],"Image"] 3b:T71f,import java.util.HashMap; import java.util.Map; import java.util.PriorityQueue; import java.util.Comparator; class Node { String id; int distance; Node(String id, int distance) { this.id = id; this.distance = distance; } } public class Dijkstra { public static Map dijkstra(Map> graph, String start) { PriorityQueue minHeap = new PriorityQueue<>(Comparator.comparingInt(node -> node.distance)); minHeap.add(new Node(start, 0)); Map dist = new HashMap<>(); dist.put(start, 0); while (!minHeap.isEmpty()) { Node currentNode = minHeap.poll(); String u = currentNode.id; int current_dist = currentNode.distance; if (current_dist > dist.getOrDefault(u, Integer.MAX_VALUE)) { continue; } for (Map.Entry neighbor : graph.getOrDefault(u, new HashMap<>()).entrySet()) { String v = neighbor.getKey(); int weight = neighbor.getValue(); int distance = current_dist + weight; if (distance < dist.getOrDefault(v, Integer.MAX_VALUE)) { dist.put(v, distance); minHeap.add(new Node(v, distance)); } } } return dist; } public static void main(String[] args) { Map> graph = new HashMap<>(); graph.put("A", Map.of("B", 1, "C", 4)); graph.put("B", Map.of("A", 1, "C", 2, "D", 5)); graph.put("C", Map.of("A", 4, "B", 2, "D", 1)); graph.put("D", Map.of("B", 5, "C", 1)); System.out.println(dijkstra(graph, "A")); // Output: {A=0, B=1, C=3, D=4} } }