Видео

👍🏻

*Insert the Overwatch Mercy meme of you saving my Algorithms&DataStructures exam!*

2024😂

Thank you so much

From UTE with love, thank you for the easy-to-understand explanation <3

best in youtube

nice explanation!! this video is 10yrs old..damn

thank you very much

nice video 👍

Thanks a lot sir.

Dude thanks so much...really appreciate this ...everyone on RUclips were too confusing to understand and put very big and complex diagrams with 22 , 18 , 15 , 12 minutes worth of videos. u were short , clear , precise ,...

Thank you

Robot

Who watching 2023 😂

Keep work hard🎉

Low quality but best content ❤❤

Suddenly I just fell sleep🤖

Great sir thanks a lot

this is one of the worst online explanation....

brilliant job👍

You are pointing one thing but another things are being come out....irritating in the day of semester exam...

Super bro

very helpful, saved me just before the exam

hindi me kya tha

Good

but how to does the machine get rid of the 0 ?

Thank you

similar crosschecking. similarity.

🔥🔥🔥

please check date before you take.

great video thanks for making it

Thank God I finally passed my NP test on my 3rd attempt with the help of Mr DAVID, I used his preparation tips. just 3 days of working with him and I passed. I was referred to him by a friend before my exams. friends I recommend you to mr DAVID. The man has the key to success

great explanation thank you kindly:)

best explanation on youtube for now :)

No explaination you just write and read

Thank You so much sir 🙏🏻

Can the same logic be applied for bi-directed graph?

Thanks.

Perform Transitive Closure with 2 lines of code. shortest code ever ⚡️🌏🛰💯 🔗 rb.gy/6l9vlq 🧐Quora discussion 🔗 rb.gy/kusyif 💎Floyd Warshal's Algorithm is an example of dynamic programming and was published in its currently recognized form by Robert Floyd in 1962. It comprises 3 nested for loops used to find all pair shortest path problems, used to construct transitive closures. 💎Amazingly, TML (Tau Meta Language) can also do the same with only 2 lines of code. tc(?x ?y):-e(?x ?y). tc(?x ?y):-tc(?x ?z), e(?z ?y). 🧀Test it. 🔗 tml.idni.org regression tests/intro/09_TRANSITIVE_CLOSURE.tml 😼Published codes 🔗 github.com/IDNI/TML 🌐Website of tml 🔗 tau.net/ 📄Abstract: Draft for Community Review 🔗lnkd.in/gWJZj9sN 👨‍🏫Tutorial Videos of TML 🔗rb.gy/9ahenx

Perform Transitive Closure with 2 lines of code. shortest code ever ⚡️🌏🛰💯 🔗 rb.gy/6l9vlq 🧐Quora discussion 🔗 rb.gy/kusyif 💎Floyd Warshal's Algorithm is an example of dynamic programming and was published in its currently recognized form by Robert Floyd in 1962. It comprises 3 nested for loops used to find all pair shortest path problems, used to construct transitive closures. 💎Amazingly, TML (Tau Meta Language) can also do the same with only 2 lines of code. tc(?x ?y):-e(?x ?y). tc(?x ?y):-tc(?x ?z), e(?z ?y). 🧀Test it. 🔗 tml.idni.org regression tests/intro/09_TRANSITIVE_CLOSURE.tml 😼Published codes 🔗 github.com/IDNI/TML 🌐Website of tml 🔗 tau.net/ 📄Abstract: Draft for Community Review 🔗lnkd.in/gWJZj9sN 👨‍🏫Tutorial Videos of TML 🔗rb.gy/9ahenx

nice explanation

Sorry but this is a horrible video, please delete it asap. Your explanation is so a mess!

worst video in youtube

check this out.. shortest code ever to perform Transitive Closure in 2 lines of codes ruclips.net/video/GfBQoAD2v3w/видео.html

To whomsoever coming here to understand this damn topic..., yes we all got professor from the same set.

Very easy Explanation 👍🏻

Tq so much sir🙏🙏

It is a bit similar to boyer moore

3:07 you state that this has degree k, but you don't explain what a degree is. I had to go elsewhere to look it up. Other than that, really easy explanation. Thx.

Thanks for this video! It helped a lot.