All points are locations. The connections between the points
have a specific weight. Not all connections are bidirectional (a
dot marks a start travel point). When Calculate is pressed, all
routes from the selected location are calculated. When a route
is selected in the listbox, the shortest route is visually shown
by coloring the start dots red. In this example, the shortest
route from 0 to 4 is going through location 2, 1 and then 4.
Dijkstra was a Dutch computer scientist who invented a fast and
simple way to calculate the shortest path between two points.
Many examples I have found on the Internet implement that
algorithm but none of them have done it in an Object Oriented
way. So I thought of making my own. Information about Dijkstra
can be found here. Using the Code The code contains two Project
classes: GUI: Shows the information visually - To add locations,
click on the 'Add Location' button and then click on the map
where you want to add locations. - To add routes, click on the
'Add Location' button