对任意给定的图（顶点数和边数自定），建立它的邻接矩阵并输出，然后利用队列的五种基本运算（置空队列、进队、出队、取队头元素、判队空）实现图的广度优先搜索算法-For any given graph (vertices and the number of edges from the set), to establish its adjacency matrix and the output, then use the queue of five basic operations (blank qu