（1）　　掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。

（2）　　掌握图的两种不同遍历方法的基本思想并能编程实现。

（3）　　掌握构造最小生成树的两种算法，即Prim 算法和Kruscal算法的思想，并能编程实现。

（4）　　能够灵活运用图的相关算法解决相应的实际问题。

-(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different storage methods. (2) two different master plans through the basic idea and can be programmed. (3) control construct two algorithms for minimum spanning tree, that Prim algorithm and Kruscal algorithm ideas, and to programming. (4) flexibility to use the corresponding graph-related algorithms to solve practical problems.