要求采用邻接矩阵作为无向图的存储结构，邻接表作为有向图的存储结构，完成无向图和有向图的建立，并对建立好的图进行深度和广度优先遍历。具体实现要求：

1.　　通过键盘输入图的顶点和边信息，分别构造一个无向图的邻接矩阵和一个有向图的邻接表。

2.　　分别对建立好的两个图进行深度和广度优先遍历，输出相应的遍历序列。

3.　　统计两个图的连通分量的个数。

-Require the use of adjacency matrix as the storage structure of an undirected graph, adjacency table as the storage structure of directed graphs, complete undirected graph and the establishment of the graph, and create good depth and breadth-first graph traversal. Specific implementation requirements: 1. Through the keyboard input graph vertices and edges information, construct an undirected graph, respectively, the adjacency matrix and adjacency to a table. 2. Are two graphs on the establishment of good depth and breadth-first traversal, the output corresponding traversal sequence. 3. Statistics of two graphs the number of connected components.