图的邻接矩阵跟邻接表的创建，遍历等，核心是深度优先遍历DFS和广度优先遍历BFS，其中广度优先遍历使用了队列，bfs写了两种方式，详情可以查看注释。使用gcc编译，-Adjacency matrix with the adjacency list creation, traversal, depth-first traversal of the core DFS and breadth-first traversal BFS, breadth-first traversal which uses the queue, bfs written in two ways, the details you can view comments. Use gcc compiler,