So, an assignment requires me to find a shortest path in a weighted undirected graph. Does anyone happen to know which is the best algorithm for this particular task? I have looked into Dijkstra's algorithm but it seems to only focus on directed graphs (would this algorithm still be the best approach?).
Any thougths on this is greatly appreciated!
This post has been edited by oha055: 03 November 2012 - 09:25 AM