Got this question in an exam.
In a graph where all edge weights are positive, if a subset S of the edges connects all vertices and has minimum total weight, then the edges in S form a tree?
True or false?
This seems to be the definition of a MST, but since it doesn't state anything about cycles I'm not 100% sure.