HDU 5636 Shortest Path【弗洛伊德 floyd】
参看资料:
https://blog.csdn.net/hexianhao/article/details/52143812
题目:
There is a path graph G=(V,E)G=(V,E) with nn vertices. Vertices are numbered from 11 to nnand there is an edge with unit length b...
原创
2019-01-16 16:39:44 ·
319 阅读 ·
0 评论