Prim's Algorithm for Creating a Minimum Spanning Tree (MST) - Min Cost to Connect Points (LC 1584)

array(10) { [0]=> object(stdClass)#4025 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "f7JOBJIC-NA" ["related_video_title"]=> string(98) "Prim's Algorithm - Minimum Spanning Tree - Min Cost to Connect all Points - Leetcode 1584 - Python" ["posted_time"]=> string(21) "4 года назад" ["channelName"]=> string(8) "NeetCode" } [1]=> object(stdClass)#3998 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "tKwnms5iRBU" ["related_video_title"]=> string(44) "12. Greedy Algorithms: Minimum Spanning Tree" ["posted_time"]=> string(19) "9 лет назад" ["channelName"]=> string(18) "MIT OpenCourseWare" } [2]=> object(stdClass)#4023 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "jsmMtJpPnhU" ["related_video_title"]=> string(53) "Prim's Minimum Spanning Tree Algorithm | Graph Theory" ["posted_time"]=> string(19) "6 лет назад" ["channelName"]=> string(12) "WilliamFiset" } [3]=> object(stdClass)#4030 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "8VPIrqwQ8sQ" ["related_video_title"]=> string(97) "Min Cost to Connect All Points (Prim's Algorithm to Create MST) - Leetcode 1584 - Graphs (Python)" ["posted_time"]=> string(19) "1 год назад" ["channelName"]=> string(9) "Greg Hogg" } [4]=> object(stdClass)#4009 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "GX01Lh2IU68" ["related_video_title"]=> string(113) "ОТКУДА В АНГЛИЙСКОМ СТОЛЬКО КОСЯКОВ - и как понять исключения?" ["posted_time"]=> string(19) "3 дня назад" ["channelName"]=> string(36) "Virginia Bēowulf · English Studies" } [5]=> object(stdClass)#4027 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "Eb91Rye4awg" ["related_video_title"]=> string(89) "Хочешь в IT? Удели Мне 49 Мин - Я Сэкономлю Тебе ГОДЫ" ["posted_time"]=> string(25) "2 месяца назад" ["channelName"]=> string(14) "Vlad Mishustin" } [6]=> object(stdClass)#4022 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "K_1urzWrzLs" ["related_video_title"]=> string(40) "Dijkstra's Algorithm vs Prim's Algorithm" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(16) "Back To Back SWE" } [7]=> object(stdClass)#4032 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "Yldkh0aOEcg" ["related_video_title"]=> string(45) "How Do You Calculate a Minimum Spanning Tree?" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(13) "Spanning Tree" } [8]=> object(stdClass)#4008 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "blWdjRUPP6E" ["related_video_title"]=> string(72) "Разведчик о том, как использовать людей" ["posted_time"]=> string(22) "13 дней назад" ["channelName"]=> string(18) "Коллектив" } [9]=> object(stdClass)#4026 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "Lwr3-doAgaI" ["related_video_title"]=> string(64) "The Last Algorithms Course You'll Need by ThePrimeagen | Preview" ["posted_time"]=> string(21) "2 года назад" ["channelName"]=> string(16) "Frontend Masters" } }