thanks a lot, sir. previously I did this problem using abdul bari Sir's method where he used the adjacency matrix and all. but our college prefers methods used in the book of Levitan. Luckily you picked the exact question and now I'm confident enough to solve it when it comes
to understand why sir made the 2nd assumption of considering b is visited before visiting c , you need to go back to brute force method . in brute force we got (n-1)! combinations right , but actually since the graph is undirected , half of the combination are actually reverse of the other half , so in essence , we have only (n-1)!/2 unique combinations . suppose we considered that we have (n-1)! combinations , half of them would have b preceding c , and the other half of them would have b succeeding c in all the possible combinations . thats why we make an assumption that b is visited before visiting c , so that the other half becomes redundant , if you still didnt understand go to section 3.4 of anany levitin textbook and read the brute force approach to solving the TSP
Sir I think there should be a correction in 21:38 as edge DE is already considered we are supposed to take DE and EA (3 and 8 respectively) for values of E and not EA and the next least edge (8 and 2 that you have taken).
because u cant consider both ab and ac at the same time one is going path other is returning path, soo we just assume one u, can assume as c also just try and see u will get the same answer
Sir your explanation is nice, but the calculation is difficult to understand, and you not providing the clear picture to understand the concepts in this TSP.
thanks a lot, sir. previously I did this problem using abdul bari Sir's method where he used the adjacency matrix and all. but our college prefers methods used in the book of Levitan. Luckily you picked the exact question and now I'm confident enough to solve it when it comes
Bruh NIE CLG??
to understand why sir made the 2nd assumption of considering b is visited before visiting c , you need to go back to brute force method .
in brute force we got (n-1)! combinations right , but actually since the graph is undirected , half of the combination are actually reverse of the other half , so in essence , we have only (n-1)!/2 unique combinations . suppose we considered that we have (n-1)! combinations , half of them would have b preceding c , and the other half of them would have b succeeding c in all the possible combinations .
thats why we make an assumption that b is visited before visiting c , so that the other half becomes redundant , if you still didnt understand go to section 3.4 of anany levitin textbook and read the brute force approach to solving the TSP
thank you!
geek
Sir I think there should be a correction in 21:38 as edge DE is already considered we are supposed to take DE and EA (3 and 8 respectively) for values of E and not EA and the next least edge (8 and 2 that you have taken).
Sir is right I think you guys are wrong
You are right
true
right , came down to comments to write the same point
Thankyou so much sir i searched a lot and finally got this video😊
Glad to hear that
Thanks a lot for this entire series sir!
I am still perplexed as to why b is visited before c?
Did you find out why?..
im very early but apparently thats part of the question, its just, there.
thank you sir for these videos
Thanks a ton sir!!!!
Sir, can u explain how u got these bounding functions in the first place?
Why second assumption done? Any purpose of it
Thankyou sir
Thank you so much sir.
Thank you sir ! 🙏
Sir for a-c the lower bound will also be 14(same as a-b). Then why are we selecting only the path a-b and not a-c(one of the possible outcomes)?
because u cant consider both ab and ac at the same time one is going path other is returning path, soo we just assume one u,
can assume as c also just try and see u will get the same answer
Sir your explanation is nice, but the calculation is difficult to understand, and you not providing the clear picture to understand the concepts in this TSP.
Sir why are we assuming that we will not visit c from a?
When are not supposed to assume any such things, only to avoid the calculations we have assumed in this problem
Sır are the lectures for DAA completed??
Refer Advanced Algorithms in the playlist for the continuation
@@datastructuresalgorithmsby7411 thank you sır
Lectures wıll be helpful..
17.49 s=37
Sir please upload Traveling salesman from dp