Implementing Dijkstra's Algorithm

Posted by DeadMG on Stack Overflow See other posts from Stack Overflow or by DeadMG
Published on 2010-05-24T18:17:35Z Indexed on 2010/05/24 18:21 UTC
Read the original article Hit count: 311

Filed under:
|
|

I've been tasked (coursework @ university) to implement a form of path-finding. Now, in-spec, I could just implement a brute force, since there's a limit on the number of nodes to search (begin, two in the middle, end), but I want to re-use this code and came to implement Dijkstra's algorithm.

I've seen the pseudo on Wikipedia and a friend wrote some for me as well, but it flat out doesn't make sense. The algorithm seems pretty simple and it's not a problem for me to understand it, but I just can't for the life of me visualize the code that would realize such a thing.

Any suggestions/tips?

© Stack Overflow or respective owner

Related posts about c++

Related posts about homework