Question: Match the following and select the correct option. 1 BFS algorithm spanning tree a Kruskal's algorithm Shortest paths Strongly Connected Components DFS algorithm 4
Match the following and select the correct option. 1 BFS algorithm spanning tree a Kruskal's algorithm Shortest paths Strongly Connected Components DFS algorithm 4 Bellman-Ford d Greedy approach algorithm ) 1-,2-,3-d,4-b b) 1-d,2-b,3-a,4-c ) 1-b,2-,3-,4-d d) 1-a,2-d,3-c,4-b 3.
Step by Step Solution
3.36 Rating (159 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
