Question
Which traversal method is most suitable for finding
connected components in an undirected graph?Solution
Depth-First Search (DFS) is ideal for finding connected components in an undirected graph. Starting from an unvisited vertex, DFS explores all reachable vertices, marking them as visited. Each DFS call identifies one connected component, and the process is repeated for all unvisited vertices. Steps: 1. Initialize all vertices as unvisited. 2. Perform DFS from each unvisited vertex. 3. Each DFS traversal marks a connected component. DFS is efficient, with a time complexity of O(V+E), making it well-suited for sparse and dense graphs. Why Other Options Are Incorrect: 1. BFS: Can also find connected components but requires more memory due to queue-based implementation. 2. Topological Sort: Applies to Directed Acyclic Graphs (DAGs) and does not determine connected components. 3. Dijkstra’s Algorithm: Finds shortest paths, not connected components. 4. Floyd-Warshall Algorithm: Computes all-pairs shortest paths, unsuitable for this task.
The formula of gypsum is:
Pollination by insects is called :
Which among the following crops is classified as a photo-insensitive plant and hence can be grown in varying photoperiods?
Which form of DNA helix is predominantly present in cell?
Which of the following statement about Pteridophytes is incorrect ?
Match List I with List II :
Choose the correct answer...
The deterioration or loss of the productive capacity of the soils due to various reasons like human activity is called as ____
Which connective tissue also act as energy source?
Which one of the following is not a biological control agent:
Milch breeds are mainly rared for milk , An example of a milch breed of cattle is: