This project is an interactive web-based application developed to visualize fundamental graph algorithms in a clear and step-by-step manner.
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Prim's Algorithm
- Kruskal's Algorithm
- Interactive graph visualization
- Step-by-step algorithm execution
- Automatic and manual traversal modes
- Custom graph creation by the user
- Visual representation of selected and examined edges
- Display of shortest path distances and algorithm progress
The main purpose of this project is to help users better understand how graph algorithms work through visual simulation and interactive execution.
Users can create their own graphs and observe how each algorithm processes nodes and edges in real time.