Tenta

Question 1

Given a graph G with costs cij = k, k ≥ 0. Then a minimum spanning
tree (MST) can be found in O(m + n).
If you think the statement is true, argue why (i.e. give an idea for an
algorithm including an short argument why the running time is correct). If you think the statement is false, give an argument why it cannot be true.

Answer 1

Yes. Edges same => use BSF or DSF