🎴 Flashcard Mode
Minimum Spanning Trees
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which algorithm is commonly used to find a Minimum Spanning Tree (MST) in a connected, undirected graph?
AnswerClick to flip back
💡 Explanation:
Both Kruskal's Algorithm and Prim's Algorithm are widely used to find Minimum Spanning Trees. Kruskal's Algorithm works by iteratively merging components of the graph based on edge weights, while Prim's Algorithm starts from a single vertex and greedily adds edges to the MST.