Virtual Labs

What is the primary purpose of Kruskal's Algorithm?

To find the minimum spanning tree of a graph
To find the shortest path in a graph
To detect cycles in a graph
To sort edges in descending order

What data structure is commonly used to check for cycles in Kruskal's Algorithm?

Stack
Queue
Disjoint Set (Union-Find)
Priority Queue

What is the time complexity of Kruskal's Algorithm when using a Union-Find data structure?

O(E log V)
O(E log E)
O(V²)
O(E²)

Which of the following is a key step in Kruskal's Algorithm?

Sorting edges by weight
Starting from a random vertex
Using a breadth-first search
Assigning infinite weights to all edges

What type of graph does Kruskal's Algorithm work on?

Weighted and connected graphs
Unweighted graphs only
Directed graphs only
Graphs with negative weights

Krushkal's Algorithm Posttest