1，图的建立与遍历操作

建立图的邻接矩阵

输出图从顶点V0出发按深度优先遍历的顶点序列

输出图从顶点V0出发按广度优先遍历的顶点序列

2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth - first traversal sequence vertex 2, and plans to establish the topological sorting