Build your intuition. Click the correct answer from the options.
Which algorithm is commonly used to find the minimum spanning tree of a graph?
Click the option that best answers the question.
- Depth-First Search (DFS)
- Breath-First Search (BFS)
- Prim's Algorithm
- Dijkstra's Algorithm