Travelling Salesman Problem - Upper Bound - Nearest Neighbour method

Поділитися
Вставка
  • Опубліковано 23 жов 2024

КОМЕНТАРІ • 10

  • @kaynatshaheen1980
    @kaynatshaheen1980 3 роки тому +3

    The route starting from B ends at A, is it right? Because for every other vertices except B, it started and ended at the same vertice.

    • @mathshelpwithmrorys8555
      @mathshelpwithmrorys8555  3 роки тому +2

      Yes, you are correct. This is an error in the video. It should list the final vertex as B. Thank you for spotting this and raising it. I will add this to the video description.

  • @andreigrigoras5740
    @andreigrigoras5740 Рік тому +2

    this method did not work for question 3 part c from 2022 decision 1 edexcel paper...
    I got ECDBAFE and EFABCDE
    they want ECDFABE and EFABDCE
    what am I doing wrong? many thanks you're a legend

    • @spockle
      @spockle Рік тому +1

      i hope you see this in time! but i finally figured it out- they want you to cross out the columns vertically. i think it’s because it’s a one way directed graph. good luck in 2 hours!

    • @andreigrigoras5740
      @andreigrigoras5740 Рік тому

      @spockle thank you! I just confirmed with my teacher and that's exactly right. I hope it comes up in the exam now
      Good luck to you too!

  • @oranalyst
    @oranalyst 4 роки тому +1

    Excellent explanation.. Thank you!

  • @abderrezakboulbrachene8197
    @abderrezakboulbrachene8197 3 роки тому +1

    in the minimum connector graph AE is 21 and not 20