GRAPH3: Strongly Connected Components (SCCs)

Описание к видео GRAPH3: Strongly Connected Components (SCCs)

This video describe the Kosaraju’s algorithm to find the strongly connected components (SCCs) in a directed graph.

The goal of this set of videos is to learn some Graph algorithms & practice applying the Graph-based transformation design paradigm to solve different common problems.

Materials of all sessions can be found at the following link:
https://cisasuedu-my.sharepoint.com/:...

0:00 Graph Usage (Recap)
2:10 Description & Solution Idea
5:54 Topological Sort
10:29 Trace Example
14:12 Correctness
24:35 Trace Example [Revisited]

Комментарии

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

Похожие видео