ALGORITHM VISUALIZATION ENGINE
ALGOSE
CHEL
DIJKSTRA'S SHORTEST PATH :: NETWORK ROUTING
ALGORITHM
Dijkstra (1959)
COMPLEXITY
O((V + E) log V)
LANGUAGE
Elixir / OTP
PARADIGM
Greedy / BFS Variant
VISUALIZER
FULL SOURCE CODE
REAL-WORLD USE CASES
PROGRESS
[ READY ]
Press
NEXT STEP
to begin. The algorithm will find shortest paths from node
A
to all other nodes.
:: Network Graph
NEXT STEP ›
AUTO RUN
↺ RESTART
SLOW
NORMAL
FAST
OPTIMAL SHORTEST PATHS FROM SOURCE (A)
:: Step-by-Step Elixir Code
module
init
pick_min
relax
run
reconstruct
:: Distance Table
NODE
DIST
PREV
STATUS
DIJKSTRA.EX — COMPLETE ELIXIR MODULE
COPY ALL
MODULE DEFINITION & GRAPH SETUP
CORE ALGORITHM FUNCTIONS
PATH RECONSTRUCTION & UTILITIES
EXAMPLE USAGE
Time Complexity:
O((V+E) log V)
Space Complexity:
O(V)
Data Structure:
Priority Queue
Limitation:
No negative weights
☀️
Light Mode