求有向图的邻接矩阵中，两点之间的最短路径以及长度-Digraph adjacency matrix, the shortest path between two points and the length of the

最小生成树路径 希望对大家有所帮助 java实验报告-The minimum spanning tree path we want to help java lab report

　（1）构造一个具有n个顶点的无向图或有向图。 　（2）输出以深度优先遍历和广度优先遍历后的顶点序列。-(1) with n vertices construct a undirected graph or digraph. (2) Output to depth-first traversal and breadth-first traversal sequence of vertices after.

数据结构相关编程，包括查找和排序，二路归并排序，链表的应用，树和二叉树，顺序表，无向图，有向图。-Related programming data structures, including search and sort, two way merge sort, list, tree and two fork tree, the order of the table, undirected graph, digraph