1.建立并显示图的邻接矩阵。 2.建立并显示图的邻接表。 3.实现图的深度优先和广度优先遍历。 4.实现最小生成树的算法。 5.实现拓扑排序算法。-(1) to establish and show the adjacency matrix. 2 and displays the adjacency table. Depth first and breadth-first traversal of the graph. (4) to achieve the minimum spa