Pathfinding Pulse

Diagnostic Engine

Algorithm

Source Trace

1function dijkstra(grid, start, end) {
2  start.distance = 0;
3  const unvisited = grid.flat();
4  while (unvisited.length) {
5    sortNodesByDistance(unvisited); 
6    const curr = unvisited.shift();
7    if (curr.isWall) continue;
8    curr.isVisited = true; 
9    if (curr === end) return getPath(end); 
10    updateNeighbors(curr, grid); 
11  }
12}

Variables

No active variables

ComplexityO(E+V\log V)

SpaceO(V)

Telemetry Log

Waiting for execution data...

Speed50

Algorithm

Dijkstra

Heuristic

N/A

Time

0.00s

Explored

Units

450

Speed

50ms

Zoom Out100%