Greetings,
My problem is, I am working on a program related to Dijkstra Algorithm. Link for your reference:
http://en.wikipedia.org/wiki/Dijkstra's_algorithm
My program's ultimate output or goal is to calculate the shortest path available to reach certain destination. (User's input of a place, and destination, program calculates and outputs the best path to take)
Can anyone advise me on how to shift the '0' to where I want them to be? Tried to echo at certain part of the functions like printMap but still, not sure which line affects the row of '0's; not the infinite distances aka 1000.
I'll appreciate any form of help and I apologise for the lengthy post.
Here is the link for the open source file.
[You might find it easier to simply attach the files - Moderator]
(To Moderator: Thanks)
Hope to hear from someone soon. Please help!
Best Regards,
Last