Wednesday, 30 January 2013

Dijkstra's Algorithm: C/C++ Program

Dijkstra's algorithm is used to solve the Single Source Shortest Path problem in Graphs. The Algorithm's time complexity is O(n2) for a graph with n nodes. Dijkstra's algorithm works only for a graph with non-negative edge path costs. 

No comments:

Post a Comment