Thanks a lot, these videos are perfect for any D1 student. These make up for my teacher sending me home with a textbook and a lot of learning to do by myself. These videos have definitely bumped me up at least one grade. Thanks so much.
@@pandalover2679 can’t imagine it went great if they finished the spec in 5 days 😂 (unless they’d already learnt it and just recapped, then it probs went okay)
You're trying to have a MST for DBC so only with these nodes must it be the case that you can not have a cycle. See Step 2 in the algorithm - create an MST for the remaining nodes ignoring the two you chose to start with. Hope this helps! Mr Hegarty
Excellent!!!!! Thnk u so much for this video. It helped me a lot. There's an upcoming D1 exam in this Jan 20th and I m glad I found a video like that.😃😃😃
thank you for the video, very helpful:) but I'm a bit confused with the lower bound. because for step 3 it says add the weights from step 1 and 2. would that not be 180+535?
Ben Small hiya - thanks loads for the message. Please take 30 secs to vote for me to help keep making videos for free for you and kids in the future. You could also win £10k so share with your family. Thanks so so much. Mr H : -) www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/
I used to find D1 really confusing, ive literally looked at all your videos and theyve been the best revision tool for my exam coming up this month, il carry on looking at them over again, just gotta ask that you don't take them down or il be lost again haha!
Exceptional Video, very helpful. Before I didn't understand this topic very well, but now my knowledge is quite good! Thanks so much, I really appreciate it! :-)
When I apply this method on a different question, I don't get a Hamiltonian cycle for the upper, nearest neighbor, or the lower bound. what should I do now? Please help! :D
Hello their I really appreciate this video and thank you very much for all the informations and the help that you provided, as well as the quality and the explanation is wonderful and amazing in the same time. I have a little question in the (39.22) and later till the end of this video i didnt understand why we don't carry on swapping the letters after A(BDCE)FGA. Can you please explain it ???? bcoz i have got BDCE=335 WHICH means that its lesser than the others and so on.
hello... how to write programs using HEAPSORT to solve Travelling Salesman Problem - TSP on programming language C ... and I need code :( im form Viet Nam...thanks
Walinase Chisenga Hiya Walinase - thanks loads for the lovely comment and there is a little way you could say thanks if you could!!! A favour to ask....Any chance you could spare 30 secs to vote for HegartyMaths in this Richard Branson competition which ends in a few days. Would mean a lot to me and HegartyMaths. www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/ Thanks Mr H
During the nearest neighbor algorithm if you had chosen D instead of C you would have got a total of 16 but obviously if you'd have done that then you couldn't explain the rest of it...;D
![FNAF vs TF2 - Episode 2 [SFM]](http://i.ytimg.com/vi/z5b3V2-VLb0/mqdefault.jpg)
Thanks a lot, these videos are perfect for any D1 student. These make up for my teacher sending me home with a textbook and a lot of learning to do by myself. These videos have definitely bumped me up at least one grade. Thanks so much.
I'm delighted you've found the videos useful - good luck revising. Thanks lots for your correction - I've popped in a correcting annotation.
2021, and you're still helping people, like me, thanks a lot fam :D
This has improved my understanding of this topic so much - thank you!
Mate I love your D1 videos theyve helped me alot, just pointing out at 36:00 , you forgot to add the 180 to the 535
I got my d1 exam in 2 days !! Thank you so much for this great video. I was able to finish the specification in under 5 days thanks to you.
How was it?
@@pandalover2679 can’t imagine it went great if they finished the spec in 5 days 😂 (unless they’d already learnt it and just recapped, then it probs went okay)
You're trying to have a MST for DBC so only with these nodes must it be the case that you can not have a cycle. See Step 2 in the algorithm - create an MST for the remaining nodes ignoring the two you chose to start with. Hope this helps!
Mr Hegarty
Excellent!!!!!
Thnk u so much for this video. It helped me a lot. There's an upcoming D1 exam in this Jan 20th and I m glad I found a video like that.😃😃😃
good luck mate!!
thank you for the video, very helpful:)
but I'm a bit confused with the lower bound. because for step 3 it says add the weights from step 1 and 2. would that not be 180+535?
youre correct brother
Lower bound is 535+180
Cheers for this!!! Got my D1 exam tomorrow, fingers crossed something like this comes up because now I really understand it, hopefully it'll go well!
Ben Small hiya - thanks loads for the message. Please take 30 secs to vote for me to help keep making videos for free for you and kids in the future. You could also win £10k so share with your family. Thanks so so much. Mr H : -) www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/
Thank you. I have a test tomorrow and this helped a lot.
I used to find D1 really confusing, ive literally looked at all your videos and theyve been the best revision tool for my exam coming up this month, il carry on looking at them over again, just gotta ask that you don't take them down or il be lost again haha!
Are we given the instructions for Nearest Neighbour in the exam?
In 3 minutes you gave me a lot of knowledge, thank you
This is really helpful, especially the tour improvement method - the algorithm in textbooks is an ugly thing but you explained it nicely!
Exceptional Video, very helpful. Before I didn't understand this topic very well, but now my knowledge is quite good! Thanks so much, I really appreciate it! :-)
Also please do go over some more examples on linear programming, thank you. D1 on the 24th.
When I apply this method on a different question, I don't get a Hamiltonian cycle for the upper, nearest neighbor, or the lower bound. what should I do now? Please help! :D
Hello their I really appreciate this video and thank you very much for all the informations and the help that you provided, as well as the quality and the explanation is wonderful and amazing in the same time. I have a little question in the (39.22) and later till the end of this video i didnt understand why we don't carry on swapping the letters after A(BDCE)FGA. Can you please explain it ???? bcoz i have got BDCE=335 WHICH means that its lesser than the others and so on.
nice i got 16 too, i was confused but not anymore thanks to your comment :)
how to imrpove accuracy of upper limit using shortcut method
what is the point of finding UB and LB??? we find them but we use NN in tour improvement.
the tour improvement "algorithm" doesn't seem very helpful. It's like brute force.... how will you do this for a large number of nodes
Very helpful. Thank you
I really think you should do a set of D2 videos!
I believe there is a mistake the lower bound is the sum of step one and step two. So 535 + 180 = 715 instead of 535. :)
wow exciting!
hello...
how to write programs using HEAPSORT to
solve Travelling Salesman Problem - TSP on programming language C ...
and I need code :(
im form Viet Nam...thanks
You're amazing!!! Thank youu soo much!! 😊😊
Thanks alot! really appreciate it.
Nearest Neighbour is the upper bound and Prims is the lower...
Stick throughout this video, it would help.
17:50 dont you create a cycle of ABC?
can i just say THANK YOUUU.
Walinase Chisenga Hiya Walinase - thanks loads for the lovely comment and there is a little way you could say thanks if you could!!! A favour to ask....Any chance you could spare 30 secs to vote for HegartyMaths in this Richard Branson competition which ends in a few days. Would mean a lot to me and HegartyMaths. www.virginmediabusiness.co.uk/pitch-to-rich/start-up/hegartymaths/ Thanks Mr H
Sure
your a boss
Pog champ
During the nearest neighbor algorithm if you had chosen D instead of C you would have got a total of 16 but obviously if you'd have done that then you couldn't explain the rest of it...;D
lol this is the easiest math problem in the world!