1．建立无向网的邻接矩阵。 要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。 2．对无向网进行深度优先遍历，输出遍历序列。 3.判断给定的无向网是否是连通的？ 要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。 -1. The establishment of the network adjacency matrix. Requirements: No input from the ke

对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型）-For any given figure (vertices not less than 20, the side for not less than 30, graph the type can be directed graph, no to figure, was the ne

有向图、有向网、无向图、无向网的创建与邻接矩阵的输出-Have to figure, was the nets, no to figure, no to create and adjacency matrix of the network of output

拓扑排序，已知一个有向网，求网的一个拓扑排序，并给出这个有向图代表的工程能否进行-Topological sort, known a have to nets, and a network of topological sort, and give the directed graph represent can project

已知一个无向网，求该网的最小生成树，该程序使用的是克鲁斯卡尔算法，求的的最小生成树-A no known to the nets, for the nets minimum spanning tree, the program is using cruise Carl algorithm, and of the minimum spanning tree