Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.


Shortest path algorithm

Users: 2 - Average Rating: 5.00

The algorithm has the following main features:
• It finds shortest path between two given nodes
• Communication network represented by a directed graph is arbitrary selected
• It supports two algorithms: Dijkstra, Bellman-ford
• Extendable to other methods

Scientific Area:


Target Group:

Author of the review:
Andrej Košir
University of Ljubljana


You have to login to leave a comment. If you are not registered click here

Eligius Hendrix

Indeed, the Dijkstra algorithm is quite basic and also easy to understand from an intuitive perspective. What I liked is that within the project, Ivo created a variant which takes care of a directed graph, to to finding the shortest path in a consept graph, where an order is forced on the concepts to be handled.