#include <stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
const int Len=105;
const int maxn = 1e5 + 10;
typedef struct Node{
int nv;//点
int ne;//边
int data[Len][Len];
int visited[Len];
}*graph;//图
typedef struct Queue
{
int data[maxn];
int rear;
int front;
}*queue;//队列
graph CreateGraph(int n)//建图
{
int i ,j;
graph g=(graph)malloc(sizeof(struct Node));
g->nv=n;
g->ne=0;
for (i=0;i<g->nv;++i){
g->visited[i]=0;
for(j=0;j<g->nv;++j){
g->data[i][j]=0;
}
}
return g;
}
void InsertEdge(graph g,int s,int e,int pow)//插入边
{
g->data[s][e]=pow;
}
Queue* MakeQueue()//建队列
{
Queue* q=(Queue*)malloc(sizeof (Queue));
q->rear=0;
q->front=0;
return q;
}
void AddQ(Queue* q,int item)//入队
{
if(q->rear+1==maxn){
printf("The Queue is full");
return ;
}
else {
q->rear=q->rear+1;
q->data[q->rear]=item;
}
}
int DeleteQ(Queue* q)//出队
{
if(q->front==q->rear){
printf("The Queue is empty");
return NULL;
}
else{
q->front=q->front+1;
return q->data[q->front];
}
}
int isEmpty( Queue *PtrlQ )//队列是否为空
{
if(PtrlQ->front == PtrlQ->rear) return 0;
else return 1;
}
int isFull( Queue *PtrlQ )//队列是否为满
{
if(PtrlQ->rear+1==maxn) return 0;
else return 1;
}
void BFS(graph g,int n,Queue *q)
{
g->visited[n]=1;
AddQ(q,n);
while (isEmpty(q)==1)
{
int m=DeleteQ(q);
printf("V%d ",m);
for (int i=0;i<g->nv;++i){
if(g->visited[i]==0&&g->data[m][i]!=0){
AddQ(q,i);
g->visited[i]=1;
}
}
}
}
int main(){
int n,i,q,b,c,d,m,s,sum=1;
// freopen("E:/c++/input.txt", "r", stdin);
// freopen("E:/c++/output.txt", "w", stdout);
scanf("%d %d",&s,&q);
graph g=CreateGraph(s);
graph gcopy=CreateGraph(s);
Queue *queue=MakeQueue();
for(i=0;i<q;++i){
scanf("%d %d %d",&b,&c,&d);
InsertEdge(g,b,c,d);
InsertEdge(gcopy,b,c,d);
}
while(~scanf("%d",&n),n!=-1){
for (i=0;i<g->nv;++i){
g->visited[i]=0;
}
printf("BFS From V%d:",n);
BFS(g,n,queue);
printf("\n");
}
// fclose(stdin);//关闭重定向输入
// fclose(stdout);//关闭重定向输出
system("pause");
return 0;
}
BFS(邻接矩阵)
最新推荐文章于 2024-06-01 20:06:44 发布