Dijkstra Algorithm

Dijkstra Algorithm is a software tool that can be used in order to find and calculate the fastest route between two points, with a minimal amount of effort.

The upper hand of a portable app

This product is portable, which means that you can easily skip the installation process, and that the Windows registry is not going to be updated with any new entries without your approval.
In addition to that, it is possible to use Dijkstra Algorithm on the fly, by simply copying the program files to a USB thumb drive, or other similar device.

User-friendly environment

The interface encompasses a pretty minimalistic layout, which closely resembles Apple’s OS design. It consists of a few buttons, a pane in which to input a map and another one in which to display the fastest route from one point to another.
Although no Help contents are incorporated, this program is quite simple to handle, for both beginners and versed individuals.

Add nodes and connect them

First and foremost, you are required to build yourself a map, by inserting nodes and connections between them. In order to find out the fastest manner in which you can get from one point to another, you have to input the start and end nodes, and click the “Search” button.

View results fast

Your ideal route is going to be highlighted on the aforementioned map, while in a dedicated pane, the nodes you have to go through are also going to be displayed.
Last but not least, you should know that this utility can easily measure distances between nodes, and it is also going to bring up the total distance from start to end.

Bottom line

In conclusion, Dijkstra Algorithm is a simple, yet handy piece of software, which does not hamper the computer’s performance, nor does it pop errors or crash. The interface is friendly to all users and all tasks are completed in a pretty timely fashion.