Soe, Naing Thura; Thant, Khin Phyo
(Third Local Conference on Parallel and Soft Computing, 2009-08-03)
Dijkstra’s Algorithm solves the problem of
finding the shortest path from a point (the source) to a
destination. This problem is sometimes called the single-source
shortest path problem. In these days, the world become ...