A&DS S03E02. Strongly Connected Components, 2-SAT

About Share Download Add to

Algorithms and data structures. Semester 3. Lecture 2. In the second lecture, we learned how to find strong connected components in a directed graph using Kosaraju's algorithm, and solve the 2-SAT problem. ITMO University, 2021

Share with your friends

Link:

Embed:

<iframe width="640" height="360" src="//myvideo.cc/embed/WVZTaGtqcHB0TWhXS1lzenZUaStSa1ltSEtsTTdadDU5N1ZybXN0dE1HWT0" frameborder="0" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>

Video Size:

Custom size:

Autoplay video

Hide player controls

Hide resume playing

Add to Playlist:

Favorites

My Playlist

Watch Later