并查集，并查集扩展，堆，矩形切割，线段树，线段树扩展，线段树应用，字段和，子阵和。-And check collection, and investigations set extensions, stack, rectangular cut, segment tree, expand the tree line, tree line applications, fields, and, sub-array and.

考虑右边的无向网，设计算法输出从顶点a到顶点i的一条带权路径长度最短的简单路径.采用递归或非递归的深度优先或广度优先遍历算法扩展实现-Consider the right to the network design algorithm output realization of recursive and non recursive depth-first or breadth-first traversal algorithm extensions from the vertex a to v