Depth First Search will not work if the graph is disconnected

[nprakhar0411]

The algorithm provided in DepthFirstSearch.cpp assumes the the graph is connected and we traverse all vertices on a single call to vertex numbered 1. Correct way should be: for(int i = 1; i <= nodes; ++i){ if(!visited[i]){ dfs(i); } }