邻接矩阵:
#include <stdio.h>
#include <stdbool.h>
#define SIX 6
int Graph[1001][1001], Queue[1001], N;
bool Visited[1001];
void Reset()
{
int i;
for (i = 1; i <= N; i++) {
Visited[i] = false;
}
}
void Read()
{
int M, i, j;
scanf("%d %d", &N, &M);
for (i = 1; i <= N; i++) {
Visited[i] = false;
for (j = 1; j <= N; j++) {
Graph[i][j] = 0;
}
}
while (M--) {
scanf("%d %d", &i, &j);
Graph[i][j] = 1;
Graph[j][i] = 1;
}
}
int BFS(int V)
{
int Front, Rear, Vertex, Tail, Last, Count, Level;
int i;
if (!Visited[V]) {
Front = Rear = 0;
Level = 0, Count = 1, Last = V;
Visited[V]