该代码实现了基于邻接表的深度优先遍历和广度优先遍历，并包含求图的割点的算法，可以在VS2010下直接运行。-The code implement the BFS and DFS of graph based on adjacence list.It includes the algorithm that find all articulated node. It can run in the environment of VS2010.