วีดีโอ

clickbait title because of misspelling

Such an amazing tuitorial of Johnson's algo is rare in online.... Thanks a lot mam for this kinds of effort to make such hard thing easier❤️

good video, but am i wrong or the 4-6 link is inverted at some time? not when inverting the whole graph

Great explanation, thank you

Don't force the accent

thanks didi

other channels just give 3 minutes speedrun but your explanation is a masterwork. Just like an art. Thank you so much. (cengçilere selam olsun :) )

Best one yet

Thanks so much for a clear explanation 🙏🙏🙏

No no no no too fast we can’t see your graph is too small and you are blocking your writing line !!!!

Your explaination is ok but you are too fast and you are putting this writing and blocking the view to your graph !!!!!

really good explanation.

Please make a playlist for learning java thank you

Awesome lecture, i think i am in love.

but why exactly five???

awesome lecture

B -> C was supposed to C-> B in original graph and residual graph right? Else flow conservation is not preserved

1,000 SUBSCRIBES YES!

thankful for explaining.

Thankyou

Thanks for the video, it was easy to understand.

Backtracking;⬅️😔 to go ➡️➡️ 😊

Dijkstra's time complexity is O(V + E log V) with a priority queue.

God the fake accent.

Great explanation; the visuals were easy to follow.

Thank you for this! Great explanation.

your videos are amazing precise and to the point and no faltu ka gyaan , loved it Thanks for all the efforts.

The content provided here is great, pls do provide such good content on other advanced topics.

Why you have such a low views count and subscriber, I checked other videos on your channel and they are quite good. I am starting my DSA journey and hope this video's will be of great use. Can you give some advice or what other material to follow to have a strong basics, same as your channel name

how is 4-5-6 a SCC? you literally cannot go from 6 to 5, what's up with this video?

th-cam.com/play/PLrpkXOsc49leVfOuJvCVXc6aKtfhOwY90.html&si=w3JGxmC8eLwAK6tU

What if we need that the last position is also the first, how would it change?

Very nice animations 🙏🙏🙏

The best videoo everrr 🙌🙌🙌

U save me, the best video!🙌🏻

Thanks for the video. Even though I'm a beginner, I wouldn't use VAR. If I see it anywhere, I'll change it to let or const. Most of the time it's const anyway. Thanks.

Backtracking Algorithm-th-cam.com/video/mWmiUleJSig/w-d-xo.htmlsi=gAyFqvoCL3eMlSiv

Very nice simple and clear, pls do more like these..❤❤

very nicely explained 🙂

complete horse shit

Very clear!

How can I find these slides

Best video about this subject!

Your Videos really help me studying for my exam at university. Thank you!

0-4 weight is 1 not 0 in the final figure.

amazing continue

hello, about Tarjan's low value at 2:20 why is the low value of vertex E not 2 ? C is reachable from E ? Thank you very much.

Are you guys still support udemy? I din see any courses released from you for a long time.

Additional information (🤓) you can also use the reversed graph at the first step and then the "normal" graph in the second step. (This is possible since the strongly connected components of a graph and of its reversed version are always the same)

Best one so far