Find the shortest path in a weighted graph using Dijkstra's algorithm. Return path and cost.

• Find the shortest path in a weighted graph using Dijkstra's algorithm

function dijkstra(graph, start, end) {
  const distances = {};
  const previous = {};
  const unvisited = new Set();
  
  for (let node in graph) {
// ...

• Dijkstra finds shortest path
• Dijkstra returns correct path

• Initialize distances to Infinity except start (0)
• Always pick unvisited node with smallest distance
• Relax edges: if new path is shorter, update distance and previous node

Find the shortest path in a weighted graph using Dijkstra's algorithm. Return path and cost.

• Find the shortest path in a weighted graph using Dijkstra's algorithm

function dijkstra(graph, start, end) {
  const distances = {};
  const previous = {};
  const unvisited = new Set();
  
  for (let node in graph) {
// ...

• Dijkstra finds shortest path
• Dijkstra returns correct path

• Initialize distances to Infinity except start (0)
• Always pick unvisited node with smallest distance
• Relax edges: if new path is shorter, update distance and previous node