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