Another implementation of Dijkstra's shortest distance algorithm

2 weeks ago i read a thread about Dijkstra's shortest distance algorithm: Dijkstra's algorithm
In this tutorial you can see how this can be used in some situations using a floorplan or a map.
The user interface consists of 4 tabs: map, points, paths and routes. Each tab pane (panel) is
transparent and can be hidden or shown using the toggle buttons.

You can use any image (*.jpg, *.png) as a backdrop in the Map layer.
You place points anywhere you like or aligned to the backdrop image in the Points layer.
You can connect the points in the Paths layer.
You can then indicate a starting point and an endpoint in the Routes layer.
After the endpoint is set the shortest distances are calculated and the shortest route is shown (in red).
You can save your (intermediate) work with the snapshot button.
In the attached files you can find the source code and a short manual that you can find here

Facial recognition?

Sensational app.

Very intuitive.

Just by looking at it I understood how it worked. Find a floor plan of a buildin, then I clicked on points and added a point at each intersection. then click on paths. Click on each node to make a path. Finally click on routes and touch two nodes. The application shows the best route.

Sensational. Congratulations. ????