-
November 13th, 2011, 12:53 AM
#1
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.
-
November 13th, 2011, 12:54 AM
#2
Re: Help With Dijkstra's Algorithm
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)
-
November 23rd, 2011, 02:29 AM
#3
Re: Help With Dijkstra's Algorithm
Possibly helpful link: A* search algorithm: https://en.wikipedia.org/wiki/A*
Best Regards,
BioPhysEngr
http://blog.biophysengr.net
--
All advice is offered in good faith only. You are ultimately responsible for effects of your programs and the integrity of the machines they run on.
-
November 27th, 2011, 04:21 PM
#4
Re: Help With Dijkstra's Algorithm
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.
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|