English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.

DFS: difficult tasks

The whole theory is in the same text about the DFS (link above at level 3), only now you already need to know everything here.

You can also look at e-maxx, in particular, there is a simple proof of the algorithm for constructing strongly connected components.

algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)