文件名称：我的迪杰斯特拉算法小结
文件大小：56KB
文件格式：DOC
更新时间：2014-07-26 04:09:41
迪杰斯特拉算法总结
迪杰斯特拉算法总结与代码描述 Problem Description One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.