Build your intuition. Click the correct answer from the options.
Which algorithm is used to find the minimum spanning tree of a graph?
Click the option that best answers the question.
- Dijkstra's algorithm
- Depth-first search
- Prim's algorithm
- Breadth-first search