📚 Practice Mode

Minimum Spanning Trees

Learn at your own pace with hints and detailed explanations

1 / 15
Multiple Choice

Which algorithm is commonly used to find a Minimum Spanning Tree (MST) in a connected, undirected graph?

  1. Dijkstra's Algorithm
  2. Kruskal's Algorithm
  3. Prim's Algorithm
  4. Floyd-Warshall Algorithm
Change Mode