说明：  图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系
(traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship)