HOW THE CONDITON THAT THERE WILL BE NO CYCLE HAVE BEEN PROOFED BY PRIM"S ALGO

CAN YOU EXPLAIN THAT HOW IT HAS BEEN IMPLEMENTED THAT THERE US NO CYCLE PRESENT

@Bhavit_Singla we appear add the node into the spanning tree which is not a part of the spanning tree. So whenever we add two disjoint sets there can never be a cycle formation.

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.