Introduction - If you have any usage issues, please Google them yourself
(1) the establishment of an undirected graph adjacency list and outputs the adjacent table.
(2) using the adjacent table storage realize undirected graph depth-first traversal. .
(3) using the adjacent table storage realize undirected graph breadth-first traversal.
(4) design a simple menu in the main function, namely debug the algorithm described above.