> мейнтейнишь генератор статических сайтов
> присылают PR \o/
> A directed graph is acyclic if and only if all strongly connected components have at most one vertex. Data.Graph provides the scc function, which uses the Kosaraju's linear-time algorithm to compute the strongly connected components.
> ты: o_O O_o O_O /o\ x_x