Shortest path algorithms are fundamental in many applications such as logistics, network optimization, transportation, and robotics. While numerous algorithms exist, their efficiency depends strongly on the graph structure, edge weights, and size. The aim of this thesis is to implement several key shortest path algorithms, benchmark them on different types of graphs, and analyze their performance in terms of runtime and scalability. Additionally, practical recommendations for algorithm selection depending on the problem instance will be derived.

Basic implementation skills in an object-oriented programming language are required for working on this topic.

Interested in this topic? Please read about the application procedure on our website!