Implementing Useful Algorithms In C Pdf -

void dfsUtil(int graph[][V], int s, int visited[]) visited[s] = 1; printf("%d ", s); for (int i = 0; i < V; i++) if (graph[s][i] && !visited[i]) dfsUtil(graph, i, visited);

return -1;

**3. Graph Algorithms**

void dfs(int graph[][V], int s) int visited[V]; for (int i = 0; i < V; i++) visited[i] = 0; implementing useful algorithms in c pdf

arr[j + 1] = key;

dfsUtil(graph, s, visited);