Thirdly, the design and analysis of algorithms is indiscussed in detail.The thesis mainly introduced the usual algorithms in solving the short path finding problem,such as Kruskal,Prime and Dijkstra.
英
美
- 第三，就算法設計與分析的理論基礎進(jìn)行了詳盡的敘述，主要介紹了用于解決最短路問(wèn)題的常用算法：庫魯斯卡爾(Kruskal)算法、普林(Prim)算法和戴克斯德拉(Dijkstra)算法。
