AlgorandSIMULATION v1.0
Sequential Engines(17)
Parallel Engines

Dijkstra's Algorithm

sequentialRAM

Finds the single-source shortest paths between nodes in a graph with non-negative edge weights.

SIMULATION STEP PROGRESSStep 1 / 1
SPEED (50%)
Code Workspace
1procedure Dijkstra(G, source)
2 for each vertex v in G:
3 dist[v] := infinity, visited[v] := false
4 dist[source] := 0
5 pq.push(source, 0)
6 while pq is not empty do
7 u := pq.pop_min()
8 if visited[u] continue
9 visited[u] := true
10 for each neighbor v of u:
11 alt := dist[u] + weight(u, v)
12 if alt < dist[v] then
13 dist[v] := alt
14 pq.push(v, alt)
15 end if
16 end while
17end procedure
Currently highlights executing branch
RUNTIME COST METRICS
Comparisons0
Memory Writes0
Memory Reads0
Elements Swapped0
Computational Model:RAM (Single Core)
Theoretical Bound:O((V + E) log V)
Space Complexity:O(V)
Communication Cost:0 (Shared Bus)
THEORETICAL ANALYSIS & RESEARCH

Conceptual Focus: Finds the single-source shortest paths between nodes in a graph with non-negative edge weights.

Real-world Industrial Applications:
  • Network routing protocols (OSPF)
  • Google Maps GPS navigation and route-finding systems