#include #include #define max 500int map[max][max]; /*标记两个顶点是否相邻, 是则1, 否则0*/int visited[max];/*标记节点是否访问,是则1, 否则0*/int bfs (int v, int n) { int j, k, maxsize, front, rear; int queue[max];/*把与顶点相邻, 没有访问的节点入队*/ maxsize = max; front = rear = 0; visited[v] = 1; printf ("%d ", v); |