About Dijkstra

Dijkstra's algorithm (or Dijkstra's Shortest Path First algorithm, SPF algorithm) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.

This app demonstrates the working of an Dijkstra's algorithm. It shows how the visited nodes progress from the starting node to the ending node. when the search ends, it returns the nodes that together have the shortest path.

How to use this app:

• You can draw a wall by clicking and dragging on the nodes
• drag the start or the end position to the preffered node position by draging them
• Start the algorithm by clicking ont the button START and enjoy the animation
• drag the start or the end position to the preffered node position by draging them
• Git hub