Let a directed and connected graph, $G=(V,E)$, with positive weights. for every $t>0$ we define $E(t)$ to be the set of edges where their weights are at most $t$. Describe an algorithm to calculate the minimal $t$ such that $G(t)=(V,E(t))$ is connected.
I really don't understand why isn't finding an MST (using Prim/Kruskal) the solution for this? What is the correct solution?
Thanks