1 bfs algorithm - a) spanning tree
2 3kruskal's algorithm-b) shortest paths
3 dfs algorithm -c) strongly connected
4 bellman-ford algorithm -d) greedy approach
match the following correct option?
Answers
Answered by
0
Explanation:
Breadth First Search (BFS) - Graph Traversal Algorithm
Similar questions