this is a wrong explanation for Boruvka, you have to check all vertices first and then in the next iteration you just check between the components but you have to check E,H and also F in the first iteration. After that you check again and because you have two components you only have to find the cheapest edge between them i.e (A,D) which then results in a MST.
Really good explanation! Keep up the good work, greetings from austria.
Really nice and well explained. Thanks
Very clear explanation. Thank you!
Great video, thank you!!
Diko magets. paano nakuha yung components? same panaman graph ko sayo ngayong exam.
Thank you so much joshua! props from portugal #Computers #MyLife
great video thankk uuuuu soo muchhh
wow thank you so much :)
Thank you for this video
Good video
this is a wrong explanation for Boruvka, you have to check all vertices first and then in the next iteration you just check between the components but you have to check E,H and also F in the first iteration. After that you check again and because you have two components you only have to find the cheapest edge between them i.e (A,D) which then results in a MST.
Sorry po
nice one
Pathetic explanation !
you are pathetic !