Question

match the following and select the correct option.

1. BFS algorithm a. spanning tree
2. Kruskal's algorithm b. shortest paths
3. DFS algorithm c. strongly connected components
4. Bellman-Ford algorithm d. Greedy approach​

Answer 1

Answer:

DFS algorithm c.strongly connected

Answer 2

Answer:

1-b

2-a

3-c

4-b

Explanation:

• Breadth-first search (BFS) is an important graph search algorithm that is used to solve many problems including finding the shortest path.
• Kruskal's algorithm uses the greedy approach for finding a minimum spanning tree.
• Depth-first search is often used as a subroutine in network flow algorithms such as the Ford-Fulkerson algorithm.
• The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices.