Strongly Connected Components - Harder Example

preview_player
Показать описание
*NOTE* None of my videos contain working code on implementing their topics. They are just designed to teach you about the topics and help prepare you for an exam on the topic by explaining the theory behind each one.
Рекомендации по теме
Комментарии
Автор

what is time complexity of the algorithm for this problem?
Is it O(n^2)??

theOceanMoon
Автор

u say choose lowest denominator, but u start from 16?!!!!

arna
welcome to shbcf.ru