并行环境下的最短路径

Introduction Team Nirnroot is looking at solving the problem of shortest path graph traversal. In particular, we will be looking at the “one-to- one” case, where we supply a start node, and it determines the shortest distance to every some destination. This, theoretically, is was Google Maps does when you tell it to compute the shortest route to your destination. (I"m not sure what it does but I"ve noticed that all my routes seem to take the same streets across town. They"re definitely cheating!) # Proposal # Final Version: Click here to download it Source Code Final jar file: Click here to download it Final Report Final PDF report: Click here to download it Final Presentation Final PDF presentation: 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报