Dijkstra's algorithm with an 2d-array

Question

For the past few days I've tried to implement this algorithm. This far I've managed to make a dynamic 2d array and insert the distances between nodes, a function to remove a path between nodes and a function that tells me if there is a path between two nodes. Now I would like to implement a function that returns the shortest path from node A to node B. I know how dijkstras algorithm works and I've read the pseudo code on wiki without being able to write any code my self. I'm really stuck here.

I've been thinking about how the code should look like and what should happen thats why I've made that function that tells me if theres a path between two nodes. Do I need any more help functions which would make implementing of dijkstras easier?

For now I have only 3 nodes but the code I would like to write needs to work in general for n nodes.

Any kind of help is appreciated.

Answer 1

You are probably thinking to much.

You need 2 things. A clean graph structure you understand. A good description of the algorithm you understand. If you have both. Just start writing some code. Helpers needed will become obvious on the way.

-- edit --
You will probably need some of the following datastructures
std::vector std::list std::priority_queue

Answer 2

I found several codes for this algorithm, but maybe it is better the simplest one in order to undertand it better, so you can check the differences between yours and this one, and complete yours. It is always better to program your way.

Have a look at this one and see if it helps.

http://vinodcse.wordpress.com/2006/05/19/code-for-dijkstras-algorithm-in-c-2/

Good luck.