掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.

实现图的基本操作，实现广度优先遍历和深度优先遍历 。-Realize the basic operation of figure, the realization of breadth-first traversal and depth-first traversal.