Description

Dijkstra Duel is an interactive web-based tool for comparing two implementations of Dijkstra's shortest path algorithm: a classic version using linear search and an optimized version using a priority queue. The application visualizes algorithm execution on randomly generated graphs, allowing users to explore performance differences through side-by-side animations.

Features

• Dual Visualization: Displays both algorithms side-by-side with live graph animations.
• Interactive Controls: Adjustable number of nodes (5–25) and animation speed (100–1000 ms).
• Performance Metrics: Real-time runtime and operation counts during execution.
• Shortest Path Tree: Highlights the computed shortest-path tree at the end of each run.

• Websitehttps://dijkstra-duel.vercel.app/
• StackNext.js, React.js, JavaScript
• SourceGitHub