Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Spanning tree

The definition of MST

Report a typo

For a connected weighted graph $G$ having $n$ nodes, a minimum spanning tree is ...

Select one option from the list

... a subgraph of

G

, that is a tree and connects all the nodes of

G

... a spanning tree that has the greatest weight among all other spanning trees of

G

... any subgraph of

G

consisting of

n - 1

edges.

... a spanning tree that has the smallest weight among all other spanning trees of

G

___

Create a free account to access the full topic