图的存储结构与遍历　　　　　
（1）画出如图（1）所示无向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）。
（2）画出如图（2）所示有向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）(The storage structure of the graph and traversal
(1) draw the adjacency matrix and adjacency list of the undirected graph as shown in figure (1), and list the breadth of the graph and the depth first traversal results (select A to go through the calendar).
(2) draw the adjacency matrix and adjacency list as shown in figure (2), and list the width and priority of the graph and the depth first traversal results (select A to go through the calendar))