Help With Dijkstra's Algorithm

Hello, I am new to programming and need help with a project I am interested in taking on. My objective is using this map (http://ion.org/outreach/muc/pdf/Mat_Arrows.pdf) starting in the box in the upper left corner, write an application that determines a route, factoring in the one way directions, to 6 of the 10 "parking lots". One catch is that after visiting one parking lot, you must move to the next in succession. The bottom line is I want a simple text output reading something like Right, Left, Straight, Left, Left, Right or whatever to be determined in real time based on which parking lots chosen. As to which language, I am most accustomed to c# and c++, but again, know very little, so if anyone knows of another language that might work better please let me know. Thanks for your help.

I might not have made this clear, but I would also like to factor in costs associated with each roads (some have a lower speed limit)

Possibly helpful link: A* search algorithm: https://en.wikipedia.org/wiki/A*

Thanks for the link. I'll look it over, however it leaves me in the same position. New to this, I am looking for an easy to follow solution tailor-made to my particular problem and any language.