{CodeRoyale}
All challenges
Multiple ChoiceHard 30s

Minimum Spanning Tree

A Minimum Spanning Tree (MST):
Options
  1. 1Contains every single edge that appears in the original graph
  2. 2Is provably unique for any connected graph that is given
  3. 3Connects all vertices with minimum total edge weight and no cycles
  4. 4Is the shortest path between any two chosen graph vertices
dsagraphshard

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.

Play this in a 3-minute battle