Algorithm Science (Summer 2025) - 29 - Connectivity
Автор: BillBird
Загружено: 2025-06-02
Просмотров: 257
Описание:
This video was made as part of a second-year undergraduate algorithms course sequence (Algorithms and Data Structures I and II).
0:00 Introduction
1:56 Connectivity
20:08 Identifying Components
29:57 Directed Connectivity
36:18 Strong Connectivity Testing
54:47 Strongly Connected Components
1:11:36 Efficiently Finding Strongly Connected Components
1:28:56 The Kosaraju-Sharir Algorithm
1:41:17 Proof of Correctness
1:58:13 Reduced Graphs
All slides and diagrams are original content (developed in early 2025). The materials used in this video, and the video itself, were prepared without any assistance from generative AI.
As any viewer will quickly realize, these videos were made just like in-person lectures: in one sitting, with no breaks, editing or script. If you find any of this helpful or interesting, please let me know (I really appreciate any other feedback as well).
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: