Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Spanning tree

Statements about MST

Report a typo

Which of the statements below are correct?

Select one or more options from the list

A MST is always a spanning tree

A spanning tree is always a MST

MST is always unique

There always is a MST for a connected weighted graph

___

Create a free account to access the full topic