BFS Traversal Program 
    #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 …