Directed acylic graphs: topological sort

[@jvjplus]

Finally understood the algorithm completely! thank you sir.

[@sudheerays9559]

yeah

[@akashghosh4766]

@@sudheerays9559 fuck your yeah

[@siddharthmundra]

Practice problems on this topic?

[@ramankhinda5967]

thank u so much sir ,,,,,,its really helpfull for me

[@sudheerays9559]

yeah

[@bohemia5302]

didn't understand, for scanning the adjacency list E, the complexity will O(n), hence the Overall
complexity of the problem becomes O(n^2). Unless we don't make an adjacency list as an Array of length N,
so our search in adjacency list become O(1).

[@hodgsontetteh4058]

i guess if u are using a hashmap adjacency list u can simply determine if a node is present or not in O(1) but if you are using a vector then I guess yr answer will be right since if u have to know if a node has a link to you ud have to traverse that vector in O(n) and doing this n times get n^2 complexity

[@RT-ny9on]

this is 100x better than my china prof

[@DeepakSingh-xt5io]

Thank you sir.

[@sudheerays9559]

thank you

[@SHASHANKRUSTAGII]

Badia videos sirji

[@sudheerays9559]

yeah

[@SHASHANKRUSTAGII]

amazing

[@sudheerays9559]

yeah

[@bipul2138]

great

[@sudheerays9559]

yeah

[@kushagr0123]

Thanks

[@itz____kamalrai8208]

Wm

[@itz____kamalrai8208]

Q