Add Pseudocode

Author: GauthamBanasandra

Pseudocode/Graph/4-July-2025/dijkstra.txt

@@ -0,0 +1,33 @@
+using Node = int
+using Cost = int
+using AdjList = unordered_map<Node, vector<pair<Node, Cost>>>
+
+Node src, dst
+AdjList adj_list
+unordered_map<Node, Cost> min_dist
+priority_queue<pair<Cost, Node>, vector<pair<Cost, Node>>, greater<pair<Cost, Node>>> order
+
+for ([u, _] : adj_list) {
+    min_dist[u] = inf
+}
+
+min_dist[src] = 0
+order.emplace(0, src)
+
+while (!order.empty()) {
+    [du, u] = order.top()
+    order.pop()
+
+    if (du > min_dist[u]) {
+        continue
+    }
+
+    for ([v, dv] : adj_list[u]) {
+        if (min_dist[u] + dv < min_dist[v]) {
+            min_dist[v] = min_dist[u] + dv
+            order.emplace(min_dist[v], v)
+        }
+    }
+}
+
+return min_dist[dst]