UVA 11478 Halum(差分约束 SPFA判负环)
You are given a directed graph G(V; E) with a set of vertices and edges. Each edge (i; j) that connects some vertex i to vertex j has an integer cost associated with that edge. Dene the operation Ha
原创
2017-07-12 17:39:24 ·
436 阅读 ·
0 评论