TechAly Code on Instagram: "⚡ Dijkstra’s Algorithm – How It Works? ⚡ Dijkstra’s Algorithm is used to find the shortest path from a source node to all other nodes in a weighted graph (with non-negative edges). 🔹 How it works: 1️⃣ Start at the source node → distance = 0, all others = ∞ (infinity). 2️⃣ Pick the node with the smallest tentative distance. 3️⃣ Update distances of its neighbors if a shorter path is found. 4️⃣ Mark the current node as “visited” (finalized). 5️⃣ Repeat until all nodes a