//有向图:有向图,无向图基本操作



//运行环境：VC

//有向图,无向图基本操作,包括:

//1、邻接矩阵

//2、邻接表

//3、深度优先遍历

//4、广度优先遍历

//5、最小生成树

//6、拓扑排序

//7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environment: VC// directed graph, undirected graph basic operation, including:// 1, adjacency matrix// 2, the adjacent table// 3 , depth-first traversal// 4, breadth-first traversal// 5, minimum spanning tree// 6, topological sorting// 7, each of the shortest path between vertices (Dijkstra, Floyd two algorithms)