1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；

2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；

3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；

4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。

5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。

-1 The basic storage methods mastered graph: adjacency matrix and adjacency list (the adjacency matrix used in the program)　

2 master basic operations related to graph algorithms and high-level language can be used to achieve (the program uses C language)　

3 master depth-first search and breadth-first traversal traversal search algorithm　

4 master plans of the two minimum spanning tree algorithm:. Prim algorithm and kruskal algorithm.

5 master shortest path of two algorithms:. DIJ algorithm and floyd algorithm.