9604BFS

#include<stdio.h>
#define SIZE 10
#define Q_SIZE 100
int Q[Q_SIZE]; int rear, front;
int G[SIZE][SIZE]; int nov;
int noe;
int visited[SIZE];
void init_Q()
{
rear = -1;
front= -1;
}
int isFull()
{
if(rear == Q_SIZE - 1) return 1;
else
return 0;
}
int isEmpty()
{
if(front == rear) return 1;
else
return 0;
}
void addQ(int item)
{
if(isFull())
{
printf("Queue is Full !! \n");
}
else
{
Rear++;
Q[rear] = item;
}
}
int delQ()
{
if( isEmpty())
{
return -1;
}
else
{
Front++;
return Q[front];
}
}