The Simple Algorithm of Finding Shortest Path of Weighted DAG

Yutao Zhou · Journal of Weifang University · 2006

Based on the characteristics of weighted DAG,the paper proposed an algorithm to solve the shortest path problems in the weighted DAG using topological sorting.The result shows that compared with traditional method,the proposed method has an excellent efficiency and low computational complexity and simple result representation.It is worthy not only at teaching but also at practice.

Read the paper · More papers on PaperTik