随笔分类 -  5.05.4 最小环

POJ 1734 Sightseeing trip
摘要：floyd求无向图最小环 +输出路径 注意保存原来的边, 求最小环的时候要用 cpp include include include include include include include using namespace std; int n, m, dis[105][105], ans = 阅读全文
posted @ 2018-03-28 15:18 Mr_Wolfram 阅读(149) 评论(0) 推荐(0)