Algorithm Implementation

Question 1

Depth First Search

Answer 1

// A function used by DFS
void DFSUtil(int v, boolean visited[])
{
// Mark the current node as visited and print it
visited[v] = true;
System.out.print(v + “ “);

    // Recur for all the vertices adjacent to this
    // vertex
    Iterator<Integer> i = adj[v].listIterator();
    while (i.hasNext()) {
        int n = i.next();
        if (!visited[n])
            DFSUtil(n, visited);
    }
}
 
// The function to do DFS traversal.
// It uses recursive DFSUtil()
void DFS(int v)
{
    // Mark all the vertices as
    // not visited(set as
    // false by default in java)
    boolean visited[] = new boolean[V];
 
    // Call the recursive helper
    // function to print DFS
    // traversal
    DFSUtil(v, visited);
}