using an incedence matrix to represent a graph, and using the Depth First Search algorithm, how does one code
the Depth First Search function to do this.
pseudo code for DFS function:
DFS(int i, processed[1 to n])
processed[i] = 1;
for each vertex W adjacent to V do
then DFS(W, processed)