Perform BFS, DFS for both connected & disconnected Graphs

import java.util.*; class Graph{ private final int V; private final List<List<Integer>> adjList; public Graph(int Vtcs) { this.V = Vtcs; adjList = new ArrayList<>(V); //[] for(int i=0 ; i<V ; i++) { ...