TEC-Bridge Logo

Dijkstra Shortest Path Algorithm Visualizer

STEM Interactive Visual Learning Program at TEC-Bridge AI

Setup Graph

Dijkstra Controls


Graph Visualization

Colors: Green = Start, Yellow = Current, Blue = Visited, Pink = Target

Distance Table

Algorithm Steps

How to Use

  1. Setup: Click "Sample Graph" to create a weighted graph
  2. Nodes: Enter start and target nodes (e.g., A, B, C)
  3. Execute: Click "Start Dijkstra" to begin the algorithm
  4. Step Through: Click "Next Step" to see each iteration or "Run Through" for automatic execution
  5. Observe: Watch distances update and shortest path emerge
  6. Reset: Click "Reset" to start over

Dijkstra's Algorithm

Dijkstra's Algorithm finds the shortest path between nodes in a weighted graph with non-negative edge weights.

How it works:

  • Initialize distances: 0 for start, ∞ for others
  • Select unvisited node with minimum distance
  • Update distances to its neighbors
  • Mark current node as visited
  • Repeat until target is reached or all visited
  • Guarantees shortest path in weighted graphs

Time Complexity: O((V + E) log V) with priority queue

Dijkstra's Algorithm Code Implementation

Rate This Learning Tool

Clarity of Visualization:
★ ★ ★ ★ ★
Interactivity:
★ ★ ★ ★ ★
Educational Value:
★ ★ ★ ★ ★
Performance:
★ ★ ★ ★ ★
Intuitivity & Usability:
★ ★ ★ ★ ★
Overall Evaluation:
★ ★ ★ ★ ★

© 2025 TEC-Bridge AI. All rights reserved. | Contact: contact@tec-bridge.ai | https://tec-bridge.ai