chain of custody template

Based on the one-way chain linear table http://blog.csdn.net/shiwazone/article/details/47000191, the circular linked list is implemented, and the circular linked list points the pointer field of the tail node to the head node. Join the loop, you can let us in the search for a node of the index, we can first determine the position and the link table length of the relationship, if index in the first half of the list, we can traverse the head node to fin

//point and Line tree are all starting from 1//side using vectorvectorint>G[MAXN];intdfs_clock,que[maxn*2],NUM[MAXN],III[MAXN],B[MAXN],A[MAXN],TOP[MAXN],DEEP[MAXN],FA[MAXN],IDX[MAXN];//use static linked list//A[i] is the weight of each point at the beginning of the tree//B[i] is the weighted value of each point after the BFS//Idx[i] is the subscript of each point in the global segment treevoidbuild_list () {intFT =0, rear =0; Que[rear++] =1; fa[1] =0; deep[1] =1; while(Ft rear) { intU =

C ++ template-type single-chain table # Pragma once // function file # include