Develop a new algorithm to determine the shortest path from a single start node in a graph to one or more end nodes within the graph

Barrie Walker


Supervised by Padraig Corcoran; Moderated by Chris B Jones

The shortest path problem involves finding the shortest path between a start point and an end point, for example finding the shortest path between Cardiff and Birmingham on a road map of the UK. This project develops a new algorithm to accomplish this and extends it to find the shortest path starting from a single start point and and ending at the nearest end point within a cluster of one or more points on a map (for example, starting from Newport, find the nearest electric car charging point in Cardiff).

Final Report (04/05/2020) [Zip Archive]

Publication Form