Kosaraju's Algorithm for Strongly Connected Components

Описание к видео Kosaraju's Algorithm for Strongly Connected Components

Table of Contents

00:00 - Introduction and Prerequisites
00:23 - Undirected Graphs: Components
01:23 - Directed Graphs: Strongly Connected Components
02:45 - Inefficient Algorithm
03:57 - Underlying Component Graph
06:11 - A Better Order
06:25 - Clever Observation 1
09:14 - Clever Observation 2
11:23 - Clever Observation 3
12:10 - Clever Observation 4
15:56 - Efficient Algorithm
16:55 - Uninterrupted Example

Комментарии

Информация по комментариям в разработке