Help w/ shortest path problem?

[rawr8512]

Hi All,

I'm not a student, nor an experienced programmer (Basically i've read and done the stuff in the cplusplus tutorials), and would like to program something which would help me find the quickest route between 2 metro stations for personal use. (Existing apps for my country suck or are mostly non-existent)

I have the list of stations, time needed to travel between stations, interchanges, and lines, and will need to hardcode them for now. (Because I haven't learnt how to connect to a database, and don't want to go into opening files yet)

I understand I may need to implement Dijkstra's algorithm, and understand HOW it works. However, being a beginner, I'm having a hard time with the implementation.

A lot of the example code I could fine online use odd code like <vertex>, which I have not learnt in the tutorial. (That looks like a html tag!) Or it would be uncommented or too complicated to read.

Hope someone can help guide me in implementing the algorithm. I would need user to input a start and end station, and the output would be the id of any interchanges the path traversed, the sum of the time needed (sum edge weights), and number of stations (nodes/vertices) travelled.

Thanks!