连接表 BFS 4 2 3

#include<stdio.h>
#include<queue>
#include<stdlib.h>
#include<iostream>
using namespace std;
struct ele
{
int num;
int value;
ele *next;
}p[125];
bool b[125];
void BFS(int x,int n)
{
ele *q;
int i,j,k;
queue<ele>it;
it.push(p[x]);
b[x]=true;
printf("%d ",x);
while(it.size())
{
q=&it.front();
it.pop();
while(q)
{
if(b[q->num]==false)
{
b[q->num]=true;
printf("%d ",q->num);
it.push(*q);
}
q=q->next;
}
}
}
int main()
{
int n,m;
ele *t;
scanf("%d%d",&n,&m);
int i,j,k;
for(i=1;i<=n;i++)
{
p[i].num=i;
p[i].value=-1;
p[i].next=NULL;
}
while(m--)
{
scanf("%d%d",&i,&j);
t=(ele*)malloc(sizeof(ele));//1
t->num=j; //2
t->value=1; //3
t->next=p[i].next; //4
p[i].next=t; //5
t=(ele*)malloc(sizeof(ele));
t->num=i; //1
t->value=1; //2
t->next=p[j].next; //3
p[j].next=t; //4
}
for(i=1;i<=n;i++)
if(b[i]==false)
BFS(i,n);
return 0;
}