在城市智能交通中,经常会用到最短路径的问题,比如找最佳的行车路线等,Dijkstra算法做为最经典的求解方法,为我们指明了方向.不过真正想让我了解该算法的原因是在学习ICTCLAS的N-最短路径算法。-Intelligent Transportation in the city, often used the issue of the shortest path, for example, to find the best travel routes, Dijkstra s algorithm

这个是很好的图形最小生成树的实现，他说明了很多最小生成树的问题，最短路问题都解决了-This is a good realization of minimum spanning tree graph, he shows a lot of the minimum spanning tree problem, shortest path problems are solved