Assuming that processed and incedence are defined as:

int processed[N];

int incedence[N][N];

The DFS function will be something like:

DFS(int i, int processed[N], int incedence[N][N])

{

int j;

processed[i] = 1;

for (j = 1; j <= N; j++)

if (j != i &&

!processed[j] &&

!incedence[i, j])

DFS(j, processed, incedence);

}

int processed[N];

int incedence[N][N];

The DFS function will be something like:

DFS(int i, int processed[N], int incedence[N][N])

{

int j;

processed[i] = 1;

for (j = 1; j <= N; j++)

if (j != i &&

!processed[j] &&

!incedence[i, j])

DFS(j, processed, incedence);

}