1class Graph {
2    constructor(n, edges) {
3        this.n = n;
4        this.adj = Array.from({ length: n }, () => []);
5        for (const [u, v, cost] of edges) {
6            this.adj[u].push([v, cost]);
7        }
8    }
9
10    addEdge(edge) {
11        const [u, v, cost] = edge;
12        this.adj[u].push([v, cost]);
13    }
14
15    shortestPath(node1, node2) {
16        const dist = new Array(this.n).fill(Infinity);
17        dist[node1] = 0;
18        const pq = new PriorityQueue((a, b) => a[0] < b[0]);
19        pq.enqueue([0, node1]);
20
21        while (!pq.isEmpty()) {
22            const [curDist, u] = pq.dequeue();
23            if (u === node2) return curDist;
24            if (curDist > dist[u]) continue;
25
26            for (const [v, cost] of this.adj[u]) {
27                if (dist[u] + cost < dist[v]) {
28                    dist[v] = dist[u] + cost;
29                    pq.enqueue([dist[v], v]);
30                }
31            }
32        }
33        return -1;
34    }
35}
36
37class PriorityQueue {
38    constructor(comparator) {
39        this.data = [];
40        this.comparator = comparator;
41    }
42
43    enqueue(value) {
44        this.data.push(value);
45        this.data.sort(this.comparator);
46    }
47
48    dequeue() {
49        return this.data.shift();
50    }
51
52    isEmpty() {
53        return this.data.length === 0;
54    }
55}
56
57// Demonstration
58const edges = [[0, 2, 5], [0, 1, 2], [1, 2, 1], [3, 0, 3]];
59const graph = new Graph(4, edges);
60console.log(graph.shortestPath(3, 2)); // Output: 6
61console.log(graph.shortestPath(0, 3)); // Output: -1
62graph.addEdge([1, 3, 4]);
63console.log(graph.shortestPath(0, 3)); // Output: 6
64