another graph question
I have just been debating my work with a few friends and now I am all muddled up and would like the opionion of anyone willing to give it to me before I go and redo the whole program :(
I have a connected weighted directional graph for which I am using an adjacency list. I have to find the shortest route from one vertex to another. What approach would you guys use.
1. What method should I use to read it into a graph
2. What method should I use to get the shortest route
Thanx in advance
>1. What method should I use to read it into a graph
You already have a graph, so what do you want to read into the graph?
>2. What method should I use to get the shortest route
There are many algorithms for doing this. But as a being a Dutchman I would suggest Dijkstra's shortest path algorithm,