BFS遍历连通图

//广度优先搜索遍历连通图
#include
using namespace std;
#define MVNum 100
#define MAXQSIZE 100
typedef char VerTexType;
typedef int ArcType;
bool visited[MVNum];
typedef struct {
VerTexType vexs[MVNum];
ArcType arcs[MVNum][MVNum];
int vexnum, arcnum;
}Graph;
typedef struct {
ArcType* base;
int front;
int rear;
}sqQueue;
void InitQueue(sqQueue& Q)
{
Q.base = new ArcType[MAXQSIZE];
if (!Q.base)
{
exit(

BFS遍历连通图最先出现在Python成神之路。