Minimum Spanning Trees

Time: 00:00:00

Attempted

Not Attempted

Marked For Review

Attempted & Reviewed

Question 1 of 15

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

Select Your Answer:

Dijkstra's Algorithm

Kruskal's Algorithm

Prim's Algorithm

Floyd-Warshall Algorithm

Mark for Review

Attempted

Not Attempted

Marked for Review

Attempted & Reviewed

Current