C++ : How to implement Dijkstra' Algorithm in Adjacency Martrix ?

I have attached my source file. I tried a lot but i couldnot create a function to find the shortest path between two vertices. If anybody help me out or atleast help me understand how to use dijkstra's algorithm in adjacency matrix. I will be thankful.

Here is the adjacency matrix source code. works fine.
Attachment 10468

So what kind of tests did you perform?

Say for example, start with just two nodes - the answer should be trivial.

Then try 3 nodes in a straight line.
Then try 3 nodes in a triangle, with an obvious difference in the path lengths.