Introduction - If you have any usage issues, please Google them yourself
1) compiling a program to extract A Table B Table duplicate node out of the formation of a new one-way increments list D.
2) Table A and Table B will merge into a new ascending order not to repeat the list are unidirectional ring C (ie duplicate numbers appear only once),
The next node in the list after the requirements of the merger last node C of C in the middle of a node point list form supine 6 shape list.
Connecting the node to the node that node C is the value closest to the average of the list.
3) to determine whether there is a chain ring.
Input: DataSource.txt
Output: list of each node C and D list each node, and an output node number is displayed point average,
Output node to the next whether there is cross ring, there is the case of the ring