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
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, 😭❣❤
God یعنی خدا مسلمان اللہ تعالیٰ کے سوا کسی کو بھی خدا نہیں کہتے میرے بھائی پلیز یہ کمنٹ delete کردیں پلیز Just for correcting you dear brother۔۔۔I'm not criticizing you۔۔۔pleasedon't mind And if you want to see explainatiion then یہ کتاب دیکھ لیں ایک بار پلیز بھائی 🙏🏻👇🏻 "کفریہ کلمات کے بارے میں سوال جواب" شکریہ بھائی
. 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.
DIVIDED BY BORDERS UNITED BY TH-cam 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😉 😀
A quick tip: We can use the previous matrices for checking if their exists a shorter path. Eg. if in any D3 if we have to find 2-4, we can use the previous matrix (2-3)+(3-4) and check if it is lesser than 2-4 or not. That would already be the shortest in the previous matrix and hence we need not to check other paths
Your explaination technique and expression is very cool and fantastic. I am using your style to explain anything. Thank you.
Came with zero knowledge, leaving with confidence and proper explanation!! Thank you sir
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
Now by your teaching, i am gaining confidence in this subject 🙅🏻♂️🥋
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
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.
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.
Why are you so good at clearing all the concepts easily😭😭❤literally you saved me😻
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
. 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
Today is my final exam DAA
Which is you university can you give question paper
Girl same
Tomorrow is my exam
@@saurojitdas4793also me
makaut 😅
DIVIDED BY BORDERS
UNITED BY TH-cam
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
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
Easy and simple explanation sir keep it up and make more videos like this so anyone can understand easily without any confusion
Thnq so much... Itna atche se samjhane ke liye...
ur all videos are excellent thank you sir love from Pakistan
Thanks you 🙏 sir your explanation is fantastic..
Thanks a lot sir for your all hardwork 🙏🙏🙏
Perfectly explained👌.
Thanks sir for amazing study experince.
Literally nailed it SIR.
MySQL ka couse ❤️❤️❤️. I like your explanation along with example
This is teacher very very Good sir
I am very very undersand sir
Thank you so much sir
Omg thanku so so much for explaining this now my concept iss Soo clear by watching this❤️
Thank you so much sir you are so sweet ☺️❤
Easy to understand. Thank you.
Thank you sir , All concept clear 😊
Video is useful 👍
Thanku sir ......
All concept clear💯🙂👍
I am very happy by seeing your all videos i have literally feel you are god of cs❤️😁
This man saves many people's life more than doctors 😅😅
Thank you so much sir bahut aacha samjaya 🙏🙏
A quick tip: We can use the previous matrices for checking if their exists a shorter path. Eg. if in any D3 if we have to find 2-4, we can use the previous matrix (2-3)+(3-4) and check if it is lesser than 2-4 or not. That would already be the shortest in the previous matrix and hence we need not to check other paths
Best teacher in the history of computer science
Thank you sir for explaining so nicely!
Have my exam tomorrow 🙏🙏
did u pass it?
Today is my cbsc exam and I can complete this unfinished chapter thanks to you. Thanks sir❤
I have no words for thanking you sir
☺
Maybe just say "THANK YOU". That ought to summarise it.
Sir ur explanation is so clear
Excellent #explaination by #gatesmashers 🇮🇳
you are gold for our backbenchers
Awesome sir g bohat zaberdast ap smjaty hy😇
Thank you sir ❤️
Very easy explanation
Thank you so much I have exam today and this help me alot 💕
Super,mindblowing,fantastic.
thank you so much SIR❤
In college didn't understand anything. Just understand the d0 then nothing. And now all understand because of you thanku sir ❤🥺✨
Thankyou so much sir for such clearing concept videos that is also at free of cost🙏🙏
Thank you so much sir ji what great lecture❤❤ you had served us thank you again for this kind of important knowledge .
Fantastic and easy to learn ❤
Path bangaya hai sir mere dimag tak ❤
Genuine Guru ji 🌝🌝
Best VideoSir i am from Pakistan 🎉
Thank you so much 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
Tomorrow is my exam 😂 and iam coming for the study
Study English first😂
Mera bhi h Kal ka 😂😂😂😂😂
Sir very helpful vedio lecture 🙏
very best teaching way
Marvellous xplaination salute to sir
Great sir ...all concepts clear...
Loo jiii....great explanation 👍
you are the great bro .life savior
Nice Sir 😊
Thanks sir I am from Pakistan big fan you sir😊
Great way of explainning
beautiful explanation
fu**ing awesome explanation !!! amazing teacher
Thank you sir really good explanation
Maza aa gaya re baba 😂
Very nice explanation ❤
Great great sir from bangladesh. Sare doubt clear hogaye.
JazakAllah (May Allah reward you)
Thank you
15:35 major and important doubt of every student
best explanation.. :) Thank you sir
Lagta hai baghwan ne apko hamare liye hi beji hein🥳 I have exams tmrw and mein pass ho jaungi😎 thanku sir🤗
too good Sir!
👏
Great as always 🙂
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 again sir❤️
wonderfully taught
Thank you sir ❤
Watching this video at 10:05. My exam started at 10:00 i.e. 5 min ago.
1 hour me meri exam hai thank you so much for this video....
Thank you sirr 😊
Varun sir respect button 🔘😎
Thank you ❤
Thank you Sir ❤️
Thank you ❤️
Thanks sooooooo much sir🥰 from 🇵🇰
25:25 but this is the minimum cost , we have to calculate the path manually , if problem has n vertices then it is difficult to do manually
Ur best sir🔥
Semester saver....🔥
thank you sir 🙏🙏🙏
Great learning
Thanks sir ❤
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
You are besttt 🤩
Very very helpful.
I used to watch your videos , today I saw my professor taking you lecture 😅😂
Thanks 👍😊
subscribe bahut jaruri h nice dialog