Adjacency Matrices and Networks

array(10) { [0]=> object(stdClass)#2594 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "UoOsI6k_0VM" ["related_video_title"]=> string(42) "Minimum Spanning Trees and Prims Algorithm" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(10) "MarbyMaths" } [1]=> object(stdClass)#2567 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "7ajJeK1EbXc" ["related_video_title"]=> string(29) "Matrices and Network Diagrams" ["posted_time"]=> string(21) "4 года назад" ["channelName"]=> string(40) "Australian Mathematics Curriculum Videos" } [2]=> object(stdClass)#2592 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "DBRW8nwZV-g" ["related_video_title"]=> string(84) "Graph Data Structure Intro (inc. adjacency list, adjacency matrix, incidence matrix)" ["posted_time"]=> string(19) "8 лет назад" ["channelName"]=> string(16) "freeCodeCamp.org" } [3]=> object(stdClass)#2599 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "5S1II7Mc8v8" ["related_video_title"]=> string(49) "Creating an Adjacency Matrix from a network graph" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(18) "Joel Speranza Math" } [4]=> object(stdClass)#2578 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "yLFDxN8aBnU" ["related_video_title"]=> string(52) "Graphs and Networks: digraphs and adjacency matrices" ["posted_time"]=> string(19) "5 лет назад" ["channelName"]=> string(40) "Australian Mathematics Curriculum Videos" } [5]=> object(stdClass)#2596 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "m4ETS8Dqgoo" ["related_video_title"]=> string(122) "Атака РФ на американский корабль? / Мир приблизился к ядерной войне" ["posted_time"]=> string(23) "8 часов назад" ["channelName"]=> string(10) "NEXTA Live" } [6]=> object(stdClass)#2591 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "bZb3a45uH78" ["related_video_title"]=> string(176) "Вундеркинд атакует! Фаустино Оро - Ян Непомнящий. Командный Чемпионат Мира по блицу - 2025. Шахматы" ["posted_time"]=> string(24) "19 часов назад" ["channelName"]=> string(62) "Шахматные идеи с Сергеем Кривенко" } [7]=> object(stdClass)#2601 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "zycRpArjzT8" ["related_video_title"]=> string(103) "Возможно ли Пройти НОВЫЙ Самый Сложный Мод в Майнкрафте?" ["posted_time"]=> string(19) "3 дня назад" ["channelName"]=> string(29) "Mud Flaps На Русском" } [8]=> object(stdClass)#2577 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "Okq--FagHHA" ["related_video_title"]=> string(146) "⚡️ Жуткий удар по столице || Решающая атака Ирана || Москва выдвинула ультиматум" ["posted_time"]=> string(23) "8 часов назад" ["channelName"]=> string(23) "Время Прядко" } [9]=> object(stdClass)#2595 (5) { ["video_id"]=> int(9999999) ["related_video_id"]=> string(11) "lnLW6ITFY3M" ["related_video_title"]=> string(60) "Introduction to Social Network Analysis [1/5]: Main Concepts" ["posted_time"]=> string(21) "3 года назад" ["channelName"]=> string(41) "The Historical Network Research Community" } }