DFS

#include <stdio.h>
#include <conio.h>
#define size 50

char visited_array[size];
int visited_seq = -1, graph[50][50], n,top = -1;
char q[50];
char vertex[26],stack[100];

void visit(char ch)
{
    visited_seq++;
    visited_array[visited_seq] = ch;
}

bool is_visit(char ch)
{
    int i;
    for(i = 0 ; i <= visited_seq ; i++)
    {
        if(ch == visited_array[i])
            return true; //Already visited
    }
    return false; //Not visited before
}

void push(char ch)
{
    stack[++top] = ch;
}

char pop()
{
    if (top == -1)
    {
        return '\0';
    }
    else
        return stack[top--];
}

void find_adjecency(char ch)
{
    int i, j;
    for(i = 0 ; i < n ; i++)
    {
        if(ch == vertex[i])
        {
            for(j = 0 ; j < n ; j++)
            {
                if(graph[i][j] == 1)
                {
//                  printf("%c ", vertex[j]);
                    if(is_visit(vertex[j]) == false)
                        push(vertex[j]);
                }
            }
        }
    }

}

void dfs()
{
    char ch;
    int x;
    printf("\nFrom which vertex you want to start?(1-50): ");
    scanf("%d",&x);
    push(vertex[x-1]);

    while(stack[top] != '\0')
    {
        ch = pop();
        if(is_visit(ch) == false)
            {
                visit(ch);
            }
        find_adjecency(ch);
    }
}

void displayVisitedArray()
{
    int i;
    printf("\nVisited Sequence is:  ");
    for(i=0; i<= visited_seq ; i++)
        printf("%c ", visited_array[i]);
}

void createGraph()
{
    int i, j;
    for(i = 0 ; i < 26 ; i++)
        vertex[i] = i+65;

    printf("How many Vertex: ");
    scanf("%d", &n);
    for(i = 0 ; i < n ; i++)
    {
        for(j = 0 ; j < n ;j++)
        {
            graph[i][j] = 0;
        }
    }

    for(i = 0 ; i < n ; i++)
    {
        for(j = i+1 ; j < n ;j++)
        {
            printf("%c-%c exist: ", vertex[i], vertex[j]);
            scanf("%d", &graph[i][j]);
            if(graph[i][j] == 1)
                graph[j][i] = 1;
        }
    }
}
int main()
{
    createGraph();
    dfs();
    displayVisitedArray();
    getch();
}