4.7 Traveling Salesperson Problem - Dynamic Programming 

Tomorrow DAA exam very Thanks 😊

There was a mistake from g(2, {4}) to g(4, {4})..The solutions are g(2, {4}) = 18, g(3, {2}) = 18, g(3, {4}) = 20, g(4, {2}) = 13, g(4, {3}) = 15

Simply outstanding! Doesn't get better than this.

Sir, you are a great teacher . Your explanation is excellent . wish you all the best and you live long with sound health . Thanks.

For those wondering what makes this a DP solution: Basically instead of finding all permutations. and then doing the arithmetic, IE, instead of doing min(1->2->3->4, 1->2->4->3, ...) of all possible routes, we can see that there are repetitive calculations in 1->2->3->4 and 1->2->4->3 for instance. The route 1->2 is common(overlap) to routes 1->2->3->4 and 1->2->4->3, if you looked at the tree closely. By definition of DP, we are trying all possibilities and we also see overlapping subproblems!

Our college teachers became teachers because they didn't get placement 😀 . and this person became teacher because of his interest. The difference can be seen 😁 clearly

thank you sir finally I understand how to solve this types of problem ....😊

The way of teaching is like bottom up approach - first solve , then derive algorithm ! Great videos - all of them : )

You the best in explaining these tough algorithms in an layman language. Thank you sir!!

Teacher is at another level 🤩👏🏼 now I can do it on my own..thank you sir

You are doing a great help to students like us sir... huge repect

Thank you sir understood this very clearly. Except for that small mistake of g(2,{4}) everything is explained well and fine. ⚡

You make the subject very easy sir. Thank you so much.

Sir one thing I've to tell you ! Watched all of your videos for 3 times or atleast 2 times perfectly and It's just because of you , today I was confidently able to write the DAA Exam under JNTU-H Thank You so much Sir ! Really lovely explantions ! and I hope you create some more videos on other Computer Subjects Sir , you were known to whole of our College and you were the one who have helped almost 450 students in our college Once again Hats Off to you Sir !

You know you will top when sir abdul bari is there. Thx sir

Sir your videos are too good and easy to understand... I studied from your algorithm Playlist only... You're a saviour... Thanks a ton!!!

Profesor Bari, you surprise me all the time, are you Magic? i have just come from another video and i could not understand what he was saying but within the first two minutes and 30 seconds here i already understand the problem... thank you

11:23 forward has some mistakes, but thanks for the video. I kinda understand

This Channel deserves more subscribers and views

Best explanation i've seen.

Sir wonderful explaination.hats off sir😍😍

Me, who Today having DAA exam😂

Great explanations!! thank you sir.

Thank u ji.. For helping before exam day..❤❤nice teaching skills saab

Awesome sir.....I'm in DAA semester exam's previous day, I'm blank about DAA, but after seen your all videos I'm very much cleared and having hope i will pass in exam👏👏👏👏👏 Hat's of sirG

Watching this a night before ADA exam . Wish me luck

He is teaching for the sake of TEACHING..and unlike others not asking for Like, Share And Subscribe 🙏🙏🙏🙏

Sir as you took g(2, {3}) =15 then all the remaining will be also like same..... But you wrote g(2, {4}) =8 it will be 18 na, and g(3, {2}) =5 but 18....g(3, {4}) =20, g(4, {2}) =13, g(4, {3}) =15.....na?

Great Videos Sir!! Really helps a lot.

Your lectures helped me to pass in my examinations 🙏

Abdul Sir you are the best! 🙏🏽

Thanks slot sir I really feel very happy after seeing u r videos it's really awesome I learned alot tqqqqqqqqq so Much

Thank you sir i gave exam today for algorithm and my exam was good thnx to you

Sir you are great sir, this help me lot in #DAA exam 🙏🙏🔥

Simple and easy explanation nice 😊we are easily understanding u r simply way ☺️

very good! thorough explanation

MashaAllah beautifully explained sir. Thanks for uploading such a great lecture. #Balochistan

Great explanation! Thx!

This is extremely useful. Thanks a lot!

I think there is mistake in this problem sir, but the way you teaching students can easily find that error😍

i was searching for this nice explaination

I should have watched this in regular of my examination 😩 Now I can pass my exam 😃

Nice explanation sir Can you please make some videos on in depth explanation on making these general dp formulas and determining if we can apply dp in a particular problem?

Bahut acche se samaj me aaya sir... Thank you...

Masha Allah your teaching very nice sir...,

sir i love your teaching method

thank yoou so much sir you make feel like a superman

Even my subject faculty is watching your videos to take classes for us sir😂😂

Sir please make video on longest common subsequence

Thanks a lot for these wonderful videos.

Well understood by this video Great ......

No one is perfect , but that mistake screwed up my solution.... Well i found a helpful guy who gave the correct values... Guys like me will get into depression if our answers don't match, so thanks to that guy....

Hello, I just saw your video on travelling sales man problem. I had another problem that is similar to this one, however we have the revenue at each location on a certain day and we want to travel through any combination of cities to figure out the maximum revenue possible. Do you have any suggestions on how I could solve this?

Best algorithms lecture

Really nice explanation sir.

So this is pretty much the same as the multistage graph problem? The algorithm starts finding out minimum costs from the end towards the starting point. The only difference is instead of having a table saving the shortest path to the next node, we have have all the combinations as some sort of list

Our teachers are watches your videos sir before teaching a lecture

The best teacher in the world

Very excellent thank you your valuable team

All the best for tomorrow's exam 😂 👍

I'm pass this exam tq soo much sir 👏😍

great explanation but it could have been awsome if algorithm would have explained with any code (C/C++)

Sir . So clear explanation . One doubt I have is in the formula you have used - {K}. Can you explain that with an example which has to be subtracted.

This is morning 5 am and today is daa exam but I'm ok daa easy and his lectures are very useful ❤😊

Thank You So Much Sir..nice explanation SIr!!!

Nice work with cool explaination

thanks alot. it was so helpful🙏🏻🙏🏻🙏🏻

Sir I want to ask if there is infinity in the matrix then what cost will be considered in the tree for that

Tomorrow DAA exam....my DAA mam is a waste...thought me nothing but how to pluck the hair........thankyou for explaining sir

Sir, Thank you for a great explanation! I have a question. For g(2, {3}) we have 15, but then should not g(2, {4}) = 18, g(3, {2}) = 18, g(3, {4}) = 20, g(4, {2}) = 13, g(4, {3}) = 15? Thank you

much helpful....thanks sir.

Sir plz tell algorithm

Haslee - free .... U blessed me

why dont you publish a book? awesome teaching

Thank you sir for wonderful explanation

Can you make a video on inventory transshipment problem for individual retailers in the system ?

Excellent teaching ❤

U teach very well sir no doubt ...bt best thing what i found is tha u take examples from text book ...it makes very easy to understand us the concept

Can we expect TSP problem with branch and bound. please share the link if you have done it before.

Please add video on travelling salesman using Branch and Bound method

awesome way to explain

you are making it from hard way

Awesome teaching

Really understandable.

One big alumni network in the comments😂. Great explanation, thanks sir!

great video and easy to understand! however, im wondering if other routes would have lower cost compared to starting from location 1? if yes, how should i find out let's say there are too many locations eg. 10? i tried substituting i = 3, the cost is also $35. the route is 3-1-2-4-3. even though the route is the same, it still shows that there is an alternative starting point so does it mean i can start with either 1 or 3 to my likings? would appreciate if someone can explain, im learning this for a school assignment!

You saved me !!

You should explain time complexity with the help of algorithm. Overall it's was very good.

at 8:51 as well as at 9:49, why 'k' is being subtracted?

Great video sir

time duration 11:14, I am little bit confused Sir at this point And the rest of it is very much helpful.

NICE SUPER EXCELLENT MOTIVATED

Tq sir I cleared my subject

Basit Sir I am able to understand why we are subtracting {K} to g(k,{2,3,4})

Sir, do i have to remember the formula as well if i understand the problem???

Tomorrow is daa exam tq sir ❤

sir ,what is shortesr link strategey for trvelling sales man problem?

sir plz explain their respective algorithmz plz sir

Good explanation thank you sir

g(2,{3})=15