c++ 广度优先搜索

#include <iostream>
using namespace std;

const int verMax=;
const int queMax=; // >=9皆可

struct node//声明图形顶点结构
{
int vertex;
struct node *next;
};

typedef struct node *graph;
struct node head[verMax];//声明顶点结构数组
int que[queMax];
int front=-;
int rear=-;
int visit[verMax];//查找记录//队列的存入

int enque(int v)
{
    if(rear>=queMax)//队列已满
    return -;
else
{
    rear++;//对了尾端指针后移
    que[rear]=v;//将值存入队列中
    return ;
    }
}
//队列的取出
int deque()
{
    if(front==rear)//队列已空
        return -;
    else
    {
        front++;
        return que[front];
    }
}
//广度优先搜索法
void BFS(int v)
{
    graph point;
    enque(v);//存入队列
    visit[v]=;//已查找
    cout<<"["<<v<<"]==>";
    while(front!=rear)
    {
        v=deque();
        point=head[v].next;
        while(point!=NULL)//读入邻接列表所有顶点
        {
            if(visit[point->vertex]==)
            {
                enque(point->vertex);//存入队列
                visit[point->vertex]=;//已查找过的顶点
                cout<<"["<<point->vertex<<"]==>";
            }
            point=point->next;
        }
    }
}
//建立邻接顶点至邻接列表内
void create_graph(int v1,int v2)
{
    graph point,New;
    New=(graph)malloc(sizeof(struct node));
    if(New!=NULL)
    {
        New->vertex=v2;//邻近顶点
        New->next=NULL;
        point=&(head[v1]);
        while(point->next!=NULL)
            point=point->next;
        point->next=New;//串连在列表尾端
    }
}
//输出邻接列表内数据
void print_graph(struct node *head)
{
    graph point;
    point=head->next;//设置point为首节点
    while(point!=NULL)
    {
        cout<<"["<<point->vertex<<"] ";
        point=point->next;
    }
    cout<<endl;
}
//主程序
void main()
{
    int node[][]={
    {,},{,},{,},{,},{,},{,},{,},{,},{,},{,},
    {,},{,},{,},{,},{,},{,},{,},{,},{,},{,}};
    int i;
    for(i=;i<verMax;i++)
    {
        head[i].vertex=i;
        head[i].next=NULL;
    }
    for(i=;i<verMax;i++)
        visit[i]=;

    for(i=;i<;i++)
        create_graph(node[i][],node[i][]);

    cout<<"======Graph======"<<endl;
    for(i=;i<verMax;i++)
    {
        cout<<"Vertex["<<i<<"]: ";
        print_graph(&head[i]);
    }
    //广度优先搜索
    cout<<"Bradth-First-Search:"<<endl<<"&BEGIN==>";
    BFS();
    cout<<"END&"<<endl;
}