This is the code submitted for the advanced programming module at the University of Hull. The code loads a text file containing nodes and edges and initialises the graph structure. Using Dijkstra algorithm the shortest path is found.
The code makes use of pointers for efficient parameter passing and processing.