Design Graph with Shortest Path Calculator problem solved

Author: hasibulislam999

Shortest Path/2642_design-graph-with-shortest-path-calculator.js

@@ -0,0 +1,83 @@
+/**
+ * Title: Design Graph with Shortest Path Calculator
+ * Description: There is a directed weighted graph that consists of n nodes numbered from 0 to n - 1. The edges of the graph are initially represented by the given array edges where edges[i] = [fromi, toi, edgeCosti] meaning that there is an edge from fromi to toi with the cost edgeCosti.
+ * Author: Hasibul Islam
+ * Date: 04/05/2023
+ */
+
+/**
+ * @param {number} n
+ * @param {number[][]} edges
+ */
+var Graph = function (n, edges) {
+  this.map = new Map();
+  let map = this.map;
+  for (let i = 0; i < edges.length; i++) {
+    let edge = edges[i];
+    let from = edge[0];
+    let to = edge[1];
+    let cost = edge[2];
+    if (!map.has(from)) {
+      map.set(from, new Set());
+    }
+
+    map.get(from).add({ to, cost });
+  }
+};
+
+/**
+ * @param {number[]} edge
+ * @return {void}
+ */
+Graph.prototype.addEdge = function (edge) {
+  let map = this.map;
+  let from = edge[0];
+  let to = edge[1];
+  let cost = edge[2];
+  if (!map.has(from)) {
+    map.set(from, new Set());
+  }
+
+  map.get(from).add({ to, cost });
+};
+
+/**
+ * @param {number} node1
+ * @param {number} node2
+ * @return {number}
+ */
+Graph.prototype.shortestPath = function (node1, node2) {
+  const heap = new MinPriorityQueue();
+  heap.enqueue({ node: node1, cost: 0 }, 0);
+  let visited = new Set();
+
+  while (heap.size() > 0) {
+    const top = heap.dequeue().element;
+
+    if (visited.has(top.node)) {
+      continue;
+    }
+    visited.add(top.node);
+    if (top.node === node2) {
+      return top.cost;
+    }
+    let next = this.map.get(top.node);
+    if (next) {
+      for (let n of next) {
+        heap.enqueue(
+          { node: n.to, cost: top.cost + n.cost },
+          top.cost + n.cost
+        );
+      }
+    }
+  }
+
+  return -1;
+};
+
+/**
+ * Your Graph object will be instantiated and called as such:
+ * var obj = new Graph(n, edges)
+ * obj.addEdge(edge)
+ * var param_2 = obj.shortestPath(node1,node2)
+ */