最短路径
ZX_zengxi
哈哈
展开
-
Jzzhu and Cities(CodeForces - 449B)
Jzzhu and Cities(CodeForces - 449B) Jzzhu is the president of country A. There are n cities numbered from 1 to n in his country. City 1 is the capital of A. Also there are m roads connecting the cities. One can go from city ui to vi (and vise versa) using原创 2017-08-06 19:00:57 · 445 阅读 · 0 评论 -
uva-1198
Let G = (V,E) be a connected graph without loops and multiple edges, where V and E are the vertex and edge, respectively, sets of G. For any two vertices u, v ∈ V ,the distance between vertices u and v in G is the number of edges in a shortest u-v path. A原创 2017-09-13 21:02:35 · 385 阅读 · 0 评论