DFS algorithm

A complete undirected graph is one where there is an edge between every pair of vertices in G. What does the Depth First Search forest of a complete graph look like? Explain. A complete undirected graph is one where there is an edge a between every pair of vertices in G. What does the Breadth First Search forest of complete graph look like? Explain