利用队列即可
code:
// test.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <deque>
using namespace std;
#define VERTNUM 6
int visited[6]={0};
void AddEdge(int* a[VERTNUM],int start,int end);
void DisplayGraph(int* a[VERTNUM]);
void BFS(int* a[VERTNUM],int* visited);
void BFSCore(int* a[VERTNUM],int i,int* visited);
deque<int> dq;
int main()
{
int** a = new int*[VERTNUM];
for(int i=0; i < VERTNUM; i++)
a[i] = new int[VERTNUM];
for(int i = 0 ; i < VERTNUM ; ++i)
for(int j = 0 ; j < VERTNUM ; ++j)
a[i][j] = 0;
AddEdge(a,0,1);
AddEdge(a,0,3);
AddEdge(a,1,4);
AddEdge(a,2,4);
AddEdge(a,2,5);
AddEdge(a,3,1);
AddEdge(a,4,3);
DisplayGraph(a);
BFS(a,visited);
delete[] a;
return 0;
}
void AddEdge(int* a[VERTNUM],int start,int end)
{
a[start][end] = 1;
}
void DisplayGraph(int* a[VERTNUM])
{
int i,j;
for(i=0;i<VERTNUM;i++){
for(j=0;j<VERTNUM;j++){
cout<<a[i][j]<<" ";
}
cout<<endl;
}
}
void BFS(int* a[VERTNUM],int* visited)
{
cout<<"Result:";
for(int i = 0 ; i < VERTNUM ; ++i)
BFSCore(a,i,visited);
cout<<endl;
}
void BFSCore(int* a[VERTNUM],int i,int* visited)
{
dq.push_back(i);
while(!dq.empty())
{
int i = *dq.begin();
dq.pop_front();
if(visited[i] == 0)
{
cout<<i<<" ";
visited[i] = 1;
for(int j = 0 ; j < VERTNUM ; ++j)
{
if(a[i][j] == 1)
dq.push_back(j);
}
}
}
}