ZOJ 2760 How Many Shortest Path (初学最大流)
题面
Given a weighted directed graph, we define the shortest path as the path who has the smallest length among all the path connecting the source vertex to the target vertex. And if two path is said t...
转载
2019-07-06 22:38:22 ·
193 阅读 ·
0 评论