BFS(Breadth First Search) Algortihm

Program In C:-
                    // Breath first search
#include<stdio.h>
#include<stdlib.h>
#define MAX 100
#define initial 1
#define waiting 2
#define visited 3

int n;
int adj[MAX][MAX];
int state[MAX];
void create_graph();
void BF_Traversal();
void BFS(int v);
int queue[MAX], front = -1,rear = -1;
void insert_queue(int vertex);
int delete_queue();
int isEmpty_queue();

int main()
{
    create_graph();
    BF_Traversal();
    return 0;
}

void BF_Traversal()
{
    int v;
    for(v=0; v<n; v++)
        state[v] = initial;
    printf("enter start vertex for BFS: \n");
    scanf("%d", &v);
    BFS(v);
}
void BFS(int v)
{
    int i;
    insert_queue(v);
    state[v] = waiting;
    while(!isEmpty_queue())
    {
        v = delete_queue( );
        printf("%d ",v);
        state[v] = visited;
        for(i=0; i<n; i++)
        {
            if(adj[v][i] == 1 && state[i] == initial)
            {
                insert_queue(i);
                state[i] = waiting;
            }
        }
    }
    printf("\n");
}
void insert_queue(int vertex)
{
    if(rear == MAX-1)
        printf("Queue Overflow\n");
    else
    {
        if(front == -1)
            front = 0;
        rear = rear+1;
        queue[rear] = vertex ;
    }
}
int isEmpty_queue()
{
    if(front == -1 || front > rear)
        return 1;
    else
        return 0;
}

int delete_queue()
{
    int delete_item;
    if(front == -1 || front > rear)
    {
        printf("Queue Underflow\n");
        exit(1);
    }
    delete_item = queue[front];
    front = front+1;
    return delete_item;
}
void create_graph()
{
    int count,max_edge,origin,destine
    printf("enter number of vertices : ");
    scanf("%d",&n);
    max_edge = n*(n-1);
    for(count=1; count<=max_edge; count++)
    {
        printf("enter edge %d( -1 -1 to quit ) : ",count);
        scanf("%d %d",&origin,&destin);

        if((origin == -1) && (destin == -1))
            break;

        if(origin>=n || destin>=n || origin<0 || destin<0)
        {
            printf("Invalid edge!\n");
            count--;
        }
        else
        {
            adj[origin][destin] = 1;
        }
    }
}
/*
enter number of vertices : 9
enter edge 1( -1 -1 to quit ) : 0
1
enter edge 2( -1 -1 to quit ) : 0
3
enter edge 3( -1 -1 to quit ) : 0
4
enter edge 4( -1 -1 to quit ) : 1
2
enter edge 5( -1 -1 to quit ) : 3
6
enter edge 6( -1 -1 to quit ) : 4
7
enter edge 7( -1 -1 to quit ) : 6
4
enter edge 8( -1 -1 to quit ) : 6
7
enter edge 9( -1 -1 to quit ) : 2
5
enter edge 10( -1 -1 to quit ) : 4
5
enter edge 11( -1 -1 to quit ) : 7
5
enter edge 12( -1 -1 to quit ) : 7
8
enter edge 13( -1 -1 to quit ) : -1
-1
enter start vertex for BFS:
0
0 1 3 4 2 6 5 7 8

*/