图的深度广度遍历和最小生成树PRIM和KRUSCA-Depth breadth traversal of the graph and the minimum spanning tree PRIM and KRUSCA, ....

图的广度和深度的遍历，图的两种遍历方法，深度遍历，广度遍历-Figure the breadth and depth of traversal, figure of two kinds of traversal methods, depth traversal and breadth traversal

图的构建，包括无向图有向图及其遍历，删除添加结点和边，广度遍历和深度遍历，并可打印出来图的结构-Figure Construction, including undirected graph directed graph traversal and delete nodes and edges add breadth and depth of traversal traversal