文件名称:4
介绍说明--下载内容均来自于网络,请自行研究使用
有关于图的最短路径算法,常用的Dijkstra和SPFA算法或可采用堆优化或可采用A*算法加速实现时间复杂度的大幅降低。但是本题中图的边长均为1,使用BFS的时间复杂度较Dijkstra和SPFA有更为明显的降低,尽管看上去BFS更为简单-Figure about the shortest path algorithm, commonly used Dijkstra algorithm and SPFA or heap can be used to optimize or A* algorithm to accelerate dramatically reduce the time complexity. However, this problem in the long side of the figure is 1, using BFS time complexity compared with Dijkstra and SPFA have a more significant reduction, even though it looked easier to BFS
(系统自动生成,下载前可以参看下载内容)
下载文件列表
4\input.txt
.\main.cpp
.\main.dev
.\main.exe
.\main.layout
.\main.o
.\Makefile.win
.\公交线路提示-课程设计报告.docx
4