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.

• 第三，就算法设计与分析的理论基础进行了详尽的叙述，主要介绍了用于解决最短路问题的常用算法：库鲁斯卡尔(Kruskal)算法、普林(Prim)算法和戴克斯德拉(Dijkstra)算法。