DFS

#include<stdio.h>
void DFS(int);

int G[10][10],visited[10],n;    //n is no of vertices and graph is sorted in array G[10][10]
int main()
{
    int i,j;
   //Enter number of vertices
    scanf("%d",&n);
    //Enter adjecency matrix of the graph
    for(i=1;i<=n;i++)
       for(j=1;j<=n;j++)
            scanf("%d",&G[i][j]);
    //visited is initialized to zero
    for(i=1;i<=n;i++)
        visited[i]=0;
    int v;
    scanf("%d",&v); // starting vertice
    DFS(v);
    return 0;
}
void DFS(int i)
{
    int j;
    printf("%d\t",i);
    visited[i]=1;
    for(j=1;j<=n;j++)
       if(!visited[j]&&G[i][j]==1)
            DFS(j);
}