I'm at present working on a route finding system for the london underground as a MIDP application in
I have a vector of vectors data structure to store the staions as nodes and lines as edges respectively
but need a shorest path algorithm to search from one station to the next taking into account line changes.
Dijkstra's algorithm seems to be the best solution but hard for me to implement.
Any help on this would be most appreciated.