Java数据结构与算法：最短路径算法

import java.util.*;
class ShortestPath {
    private int vertices;
    private int[][] graph;
    public ShortestPath(int vertices) {
        this.vertices = vertices;
        this.graph = new int[vertices][vertices];
    }
    public void addEdge(int source, int destination, int weight) {
        graph[source][destination] = weight;
        graph[destination][source] = weight;
    }
    public int[] dijkstra(int source) {
        int[] distance = new int[vertices];
        Arrays.fill(distance, Integer.MAX_VALUE);
        distance[source] = 0;
        Set<Integer> visited = new HashSet<>();
        PriorityQueue<Node> minHeap = new PriorityQueue<>(Comparator.comparingInt(node -> node.distance));
        minHeap.offer(new Node(source, 0));
        while (!minHeap.isEmpty()) {
            Node currentNode = minHeap.poll();
            int currentVertex = currentNode.vertex;
            if (visited.contains(currentVertex)) {
                continue;
            }
            visited.add(currentVertex);
            for (int neighbor = 0; neighbor < vertices; neighbor++) {
                int edgeWeight = graph[currentVertex][neighbor];
                if (edgeWeight > 0 && !visited.contains(neighbor)) {
                    int newDistance = distance[currentVertex] + edgeWeight;
                    if (newDistance < distance[neighbor]) {
                        distance[neighbor] = newDistance;
                        minHeap.offer(new Node(neighbor, newDistance));
                    }
                }
            }
        }
        return distance;
    }
    private static class Node {
        int vertex;
        int distance;
        public Node(int vertex, int distance) {
            this.vertex = vertex;
            this.distance = distance;
        }
    }
}
public class DijkstraExample {
    public static void main(String[] args) {
        ShortestPath graph = new ShortestPath(6);
        graph.addEdge(0, 1, 2);
        graph.addEdge(0, 2, 4);
        graph.addEdge(1, 2, 1);
        graph.addEdge(1, 3, 7);
        graph.addEdge(2, 4, 3);
        graph.addEdge(3, 4, 1);
        graph.addEdge(3, 5, 5);
        graph.addEdge(4, 5, 2);
        int[] shortestDistances = graph.dijkstra(0);
        System.out.println("Shortest Distances from Source (Vertex 0): " + Arrays.toString(shortestDistances));
    }
}