ME - OTS 3

Question

Comments

I use floyd warshall  : O(2E+V) * V = O(2EV+ $V^{}2$ ) = O( $V^{}2$)

---

@HeadShot

how about using prims algorithm

modify the algo such that for each iteration, check if the vertices belong the given sets.

because we use adjacency list the time complexity would be O((v+e)logv).

---

I think floyd warshall will be better here.

---

Provided Answer :