Introduction to Minimum Spanning Trees

array(10) { [0]=> object(stdClass)#5248 (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" } [1]=> object(stdClass)#5221 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "6R179MBYMhY" ["related_video_title"]=> string(41) "Kruskal's Minimum Spanning Tree Algorithm" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(24) "Algorithms with Attitude" } [2]=> object(stdClass)#5246 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "BZb-ozM2PWo" ["related_video_title"]=> string(59) "Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(24) "Algorithms with Attitude" } [3]=> object(stdClass)#5253 (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" } [4]=> object(stdClass)#5232 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "EK32jo7i5LQ" ["related_video_title"]=> string(145) "Почему простые числа образуют эти спирали? | Теорема Дирихле и пи-аппроксимации" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(11) "3Blue1Brown" } [5]=> object(stdClass)#5250 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "ati3Wsc-QoU" ["related_video_title"]=> string(174) "СЛИТЫЕ ДОКЛАДЫ ФСБ: КИТАЙ ВЕДЕТ КИБЕРВОЙНУ ПРОТИВ РОССИИ. И присматривается к Дальнему Востоку" ["posted_time"]=> string(24) "11 часов назад" ["channelName"]=> string(19) "Майкл Наки" } [6]=> object(stdClass)#5245 (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" } [7]=> object(stdClass)#5255 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "i-FFVM4cIXQ" ["related_video_title"]=> string(138) "База по Базам Данных - Storage (Индексы, Paging, LSM, B+-Tree, R-Tree) | Влад Тен Систем Дизайн" ["posted_time"]=> string(22) "12 дней назад" ["channelName"]=> string(15) "Влад Тен" } [8]=> object(stdClass)#5231 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "NHsDeapLxNs" ["related_video_title"]=> string(109) "Разбор задач с Мишенькой: отбор на Международную олимпиаду!" ["posted_time"]=> string(23) "1 месяц назад" ["channelName"]=> string(75) "Маткульт-привет! :: Алексей Савватеев и Ко" } [9]=> object(stdClass)#5249 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "pe_ejTiIcSs" ["related_video_title"]=> string(53) "Похудей на 45 КГ, Выиграй $250,000!" ["posted_time"]=> string(21) "5 дней назад" ["channelName"]=> string(7) "MrBeast" } }