Spanning Trees

Front

The graph shown contains NO cycles.

Back

True

Front

The graph shown contains NO cycles.

Back

False

Front

Create a minimal spanning tree, then find the minimum total cost.

Back

39

Front

Create a minimal spanning tree, then find the minimum total cost.

Back

The minimum total cost is 21.

Front

The number of vertices in a tree with 12 edges is

Back

13

Front

Using Kruskal’s algorithm, which edge should you choose second? Options: AE, BD, DE, AB

Back

DE

Front

Using Kruskal’s algorithm, which edge should you choose fourth? Options: AB, BC, BD, DE

Back

BC

Front

Find the minimum spanning tree (MST) using Kruskal’s algorithm and provide the overall weight.

Back

25

Front

Find the minimum spanning tree (MST) using Kruskal’s algorithm and provide the overall weight.

Back

28