How To Find The Shortest Path In An Adjacency Matrix ?

[Applellial]

I tried to create an adjacency matrix. It has add function which takes two vertices as input and their weight(distance).Everything worked fine i guess so. Now I want to create a function that will help me find the shortest path between two vertices.I tried dijkstra's algorithm. It seems my skill not good enough to create this function.

[Anonie]

dijkstra's is generally the best way to do this with low number of nodes since it always gives best case each time. so keep at it and ask your teacher for help, or ta. and i doubt that anyone's gonna help you out if you don't give more information like language, or at least the files you've got already.