{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/288b3388a3a6437aaf6675533d7aefd4\" frameborder=\"0\" width=\"1838\" height=\"1378\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":1378,"width":1838,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":1378,"thumbnail_width":1838,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/288b3388a3a6437aaf6675533d7aefd4-cd45df017c5e662f.gif","duration":4392.449,"title":"9FM0 D1 Set 6 Prims Kruskals &amp; MSTs","description":"In this video, I walk through a complex problem involving prims, nearest neighbour algorithms, and minimal spanning trees, specifically focusing on a scenario with six ponds and the time it takes to check them. I detail my calculations, revealing that the nearest neighbour from A is two less than the total length from D, leading to the conclusion that x equals 13. I emphasize the importance of understanding how to derive these values and the relationships between them. Additionally, I discuss how to apply this knowledge to find the quickest time to check all six ponds starting and finishing at A. I encourage viewers to follow along with the calculations and ensure they grasp the concepts presented."}