hi, im having trouble implementing a shortest path program in c++,

i have a graph that i want to beable to start from any node and find the shotest path to any other node.
I have so far only been able to write the code to get the start and end node, and make sure that only A-G (the nodes) can be entered.
Ive looked at dijktras but am unable to get it in my code.

any help would be great, cheers.

Make a function and call it at line 22 after you set your path variable to 4.

__________________

During the election they said Obama could only be elected when pigs fly. Well, we currently have an epidemic of Swine Flu. Coincidence?