This repo provides the implementation and visualisation of Dijkstra's algorithm. Dijkstra's algorithm is used to find the shortest path from a single source vertex to all other vertices in a given ...

This is a simple WPF application to visualize Dijkstra's and A* pathfinding algorithms. The application allows users to interactively create obstacles, move the start and end nodes, and see the ...