0
$\begingroup$

In finding a minimum spanning tree, if we use a BFS and at any node instead of deleting the edge to a repeated node, we can find the most expensive node in that cycle instead and delete it. In such a case, will the time complexity remain O(E+V)?

$\endgroup$
1
  • $\begingroup$ What did you try? Where are you stuck? Did you try to write the pseudocode for the algorithm and analyse it? $\endgroup$
    – Pål GD
    Commented Sep 27, 2023 at 8:26

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.