You can also use the previous table for the minimum weight here. for example in D4 if we want [3:2] we can search for values of [3:4]+[4:2] from previous table(i.e D3)
Indeed a Very fast way , but Might not always give the minimum result in everycase e.g in the same D4 matrix , if we want to go from 1:3 via 4 Then 3:4 + 4:3 of d3 gives 5+3=8 which is not the shortest path , but 3 is the shortest path
God یعنی خدا مسلمان اللہ تعالیٰ کے سوا کسی کو بھی خدا نہیں کہتے میرے بھائی پلیز یہ کمنٹ delete کردیں پلیز Just for correcting you dear brother۔۔۔I'm not criticizing you۔۔۔pleasedon't mind And if you want to see explainatiion then یہ کتاب دیکھ لیں ایک بار پلیز بھائی 🙏🏻👇🏻 "کفریہ کلمات کے بارے میں سوال جواب" شکریہ بھائی
sir like literally you are the greatest, Tomorrow is my discrete math exam and i've already done all the topics except this one, so sir once again thank you thank you so much, Teachers like you should be in every single college in india, 😭❣❤
DIVIDED BY BORDERS UNITED BY CZcams Lots of respect and LOVE FROM PAKISTAN❤❤ I saw many videos of u n you explained each n everything very well specially that analysis of algorithm's topic. keep doing this always n God bless u always😊😊 FUN FACT: YOU RESEMBLE CRICKETER HARDIK PANDYA😉 😀
. Excellent class...One suggestion for improving speed. while manual calculation.It will be easy to observe the just previous matrix corresponding cell values instead of scanning the graph each time for better path. Already the min possible values between 2 nodes are updated and entered in the previous matrix. Therefor no need to again get the values through complete possible options from the graph.
I think this video has an error. When you are building a table you look at previous table NOT original graph. So if you are building D4 table and want to know 1-3. The answer will be min of: D2[1,3] or (D2[1-2]+D2[2-3]). The instructor is using original graph for computing [1-2] [2-3]. This is wrong and may have worked in this example but will fail test cases on leetcode. Note original graph is also D0.
[D1 ]In 1st row 1 to 3 we can travel with 9 < ♾️ infinity .... 1 to 2 is 8 2 to 3 is 1 But why did you considered it as infinity ♾️ My ans : via 1 there is option Is it correct?
@@satyanarayandalei-rz2kw no in D1 we can only travel through 1 , and in D2 through 1 and 2 , D3 1,2,3 , lastly in D4 we go any way like all can be visited like you dont need to travel whole graph , by comparing before matrix u need to find best and minimum cost
You can also use the previous table for the minimum weight here. for example in D4 if we want [3:2] we can search for values of [3:4]+[4:2] from previous table(i.e D3)
This would be more easy, thank u
yes that's what you should do , suppose you had 6-7 edges then his method will take forever
true
yosh good way to tackle this problem. thnx bro!!!
Indeed a Very fast way , but Might not always give the minimum result in everycase
e.g in the same D4 matrix , if we want to go from 1:3 via 4
Then 3:4 + 4:3 of d3 gives 5+3=8 which is not the shortest path , but 3 is the shortest path
Person is God Literally watch his videos as last minute and I bet your topics will be covered as quick as a wink.
God
یعنی خدا
مسلمان اللہ تعالیٰ کے سوا کسی کو بھی خدا نہیں کہتے میرے بھائی
پلیز یہ کمنٹ delete کردیں پلیز
Just for correcting you dear brother۔۔۔I'm not criticizing you۔۔۔pleasedon't mind
And if you want to see explainatiion then
یہ کتاب دیکھ لیں ایک بار پلیز بھائی 🙏🏻👇🏻
"کفریہ کلمات کے بارے میں سوال جواب"
شکریہ بھائی
@@Sayyed_Sana you are right.
@@Sayyed_Sana tum bewkoof hi rahoge uska matlab tha ki sir ne itna accha padaya ki esa laga iswar ne padaya h. Tumari buddhi sahi me ghutne me h
There is no god except Allah ❤️
I testify that there is no God except ALLAH and Prophet Muhammad SAW is His last messenger.
Your explaination technique and expression is very cool and fantastic. I am using your style to explain anything. Thank you.
sir like literally you are the greatest, Tomorrow is my discrete math exam and i've already done all the topics except this one, so sir once again thank you thank you so much, Teachers like you should be in every single college in india, 😭❣❤
same like mine thank you sir
Mujhe samjh ni aaya ya samjhya sahi ni h .....🙄 Y topic clear ni hoga iska matlab mera bcz m to aap pr hi depend hu
Came with zero knowledge, leaving with confidence and proper explanation!! Thank you sir
Now by your teaching, i am gaining confidence in this subject 🙅🏻♂️🥋
All my doubts are cleared by your video you are best teach thank you so much☺❤
use doubt nahi bolte aapko topic hi nahi aata tha na
DIVIDED BY BORDERS
UNITED BY CZcams
Lots of respect and
LOVE FROM PAKISTAN❤❤ I saw many videos of u n you explained each n everything very well specially that analysis of algorithm's topic. keep doing this always n God bless u always😊😊
FUN FACT: YOU RESEMBLE CRICKETER HARDIK PANDYA😉 😀
hardik or KL rahul?? lol
Today is my final exam DAA
Which is you university can you give question paper
Girl same
Tomorrow is my exam
@@saurojitdas4793also me
makaut 😅
If you didn't exist, I wouldn't have passed my BSc i Engineering. You're making this world a better place, sir. Love from Bangladesh.
Tomorrow is my exam 😂 and iam coming for the study
Study English first😂
Mera bhi h Kal ka 😂😂😂😂😂
. Excellent class...One suggestion for improving speed. while manual calculation.It will be easy to observe the just previous matrix corresponding cell values instead of scanning the graph each time for better path. Already the min possible values between 2 nodes are updated and entered in the previous matrix. Therefor no need to again get the values through complete possible options from the graph.
Yes mam u r right
I was thinking about it before seeing the comment. But I was not sure whether will that work every time or not! Thank you ma'am for clearing my doubt.
Yes you are right, always we have to see previous matrix instead of seeing graph everytime.
Very true. It actually defeats the purpose of algorithm.
Indeed that's basically the essence of the algorithm. Avoiding re-visit to already calculated answer
U are the best teacher thank u so very much God bless u sir
For 2 years straight I didn't have courage to solve floyad warshall and TSP but coz this video I am confident
Thanks a lot sir for your all hardwork 🙏🙏🙏
Thank you sir for explaining so nicely!
Have my exam tomorrow 🙏🙏
did u pass it?
Thanks you 🙏 sir your explanation is fantastic..
Perfectly explained👌.
Thnq so much... Itna atche se samjhane ke liye...
Today is my cbsc exam and I can complete this unfinished chapter thanks to you. Thanks sir❤
ur all videos are excellent thank you sir love from Pakistan
Thank you sir , All concept clear 😊
This man saves many people's life more than doctors 😅😅
MySQL ka couse ❤️❤️❤️. I like your explanation along with example
Omg thanku so so much for explaining this now my concept iss Soo clear by watching this❤️
I have no words for thanking you sir
☺
Maybe just say "THANK YOU". That ought to summarise it.
thank you so much SIR❤
This is teacher very very Good sir
I am very very undersand sir
Thank you so much sir
Thanks sir for amazing study experince.
Literally nailed it SIR.
Thank you so much sir ji what great lecture❤❤ you had served us thank you again for this kind of important knowledge .
Excellent #explaination by #gatesmashers 🇮🇳
Thank you so much I have exam today and this help me alot 💕
Thanku sir ......
All concept clear💯🙂👍
Video is useful 👍
I am very happy by seeing your all videos i have literally feel you are god of cs❤️😁
Thank you sir ❤️
Very easy explanation
Nice Sir 😊
Sir ur explanation is so clear
Fantastic and easy to learn ❤
Thank you so much sir🫡
Best teacher in the history of computer science
Thankyou so much sir for such clearing concept videos that is also at free of cost🙏🙏
you are gold for our backbenchers
Thank you so much sir bahut aacha samjaya 🙏🙏
I used to watch your videos , today I saw my professor taking you lecture 😅😂
Super,mindblowing,fantastic.
Sir very helpful vedio lecture 🙏
beautiful explanation
sir in D1 matrix , the 4-3 = 9 || but shortest path is 4-2 & 2-3 = 2+1 = 3... which one is correct?
in D1 we have to use only the 1st vertex(1), we cant use 2
Awesome sir g bohat zaberdast ap smjaty hy😇
Maza aa gaya re baba 😂
Thank you sir really good explanation
you are the great bro .life savior
JazakAllah (May Allah reward you)
Thank you
Great sir ...all concepts clear...
Marvellous xplaination salute to sir
very best teaching way
Lagta hai baghwan ne apko hamare liye hi beji hein🥳 I have exams tmrw and mein pass ho jaungi😎 thanku sir🤗
Jay shree ram
Great way of explainning
Best VideoSir i am from Pakistan 🎉
Path bangaya hai sir mere dimag tak ❤
Very nice explanation ❤
Great great sir from bangladesh. Sare doubt clear hogaye.
best explanation.. :) Thank you sir
13:28 for(4-1)we can also go through (4-3)and (3-1)that is 9+4 which is less than infinity so why u go through ?(4-2)and (2-1)??
same doubt
Thank you ❤
Thank you ❤️
wonderfully taught
Loo jiii....great explanation 👍
Genuine Guru ji 🌝🌝
Thank you sir ❤
Thank you Sir ❤️
thank you sir 🙏🙏🙏
15:35 major and important doubt of every student
subscribe bahut jaruri h nice dialog
Thanks sir I am from Pakistan big fan you sir😊
Great as always 🙂
Semester saver....🔥
Thank you again sir❤️
Thank you sirr 😊
fu**ing awesome explanation !!! amazing teacher
Why we use this Algo as we already have Dijkstra or bellman ALGO?
Better time complexity.
too good Sir!
👏
Thanks 👍😊
Very very helpful.
Thanks sir ❤
9:14 sir ham 4 se 2 or fir 2 se 3 jate tb to minimum path milta hame jo ki 9 se kam hota
Varun sir respect button 🔘😎
Watching this video at 10:05. My exam started at 10:00 i.e. 5 min ago.
Thank you so much sir
Thanks sir 😁💛
Great learning
Thanks sir ❤
Finally more than two hours got it.
best one sir thank you
I think this video has an error. When you are building a table you look at previous table NOT original graph. So if you are building D4 table and want to know 1-3. The answer will be min of:
D2[1,3] or (D2[1-2]+D2[2-3]).
The instructor is using original graph for computing [1-2] [2-3]. This is wrong and may have worked in this example but will fail test cases on leetcode.
Note original graph is also D0.
Thankyou very much sir
subscribers bht jaroori hai ,,,,the most funniest line .i like it when sir say this ....
[D1 ]In 1st row 1 to 3 we can travel with 9 < ♾️ infinity ....
1 to 2 is 8
2 to 3 is 1
But why did you considered it as infinity ♾️
My ans : via 1 there is option
Is it correct?
Really I was looking for this comment. I also think so. We can go 1 to 3 via 2
@@satyanarayandalei-rz2kw no in D1 we can only travel through 1 , and in D2 through 1 and 2 , D3 1,2,3 , lastly in D4 we go any way like all can be visited like you dont need to travel whole graph , by comparing before matrix u need to find best and minimum cost