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

1、邻接矩阵

2、邻接表

3、深度优先遍历

4、广度优先遍历

5、最小生成树

6、拓扑排序

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