杭电最短路径（Hangzhou Electric shortest path）.docVIP

杭电1874最短路径（Hangzhou Electric 1874 shortest path） HDU 1874 comparison basis, used to practice a variety of just learned algorithm is better, you can avoid many traps, typical of the most short-circuit template problems The first solution: Floyd algorithm Algorithm implementation: Use an adjacency matrix to store the edge weights. The number of accesses between 22 must be a finite number, and if not accessible, it is infinite (replaced by 2^29). Note that the distance between yourself and yourself is 0. For a pair of vertices u and V, see if there is a breakpoint w that makes W from u to V short