Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Graph theory TSP Help?

Options
  • 25-07-2012 4:06pm
    #1
    Iancar29
    Registered Users Posts: 5,068 ✭✭✭


    Hey guys , me again unfortunately...

    This time im on the Travelling salesmen problem in graph theory and really can find any good examples of learning how to do them.

    If anyone here knows how or knows of a link to some examples they would be much appreciated! :)

    In anyways heres the one im on at the moment.

    255344_10151124434846718_630044766_n.jpg
    I know its to do with a Euler cycle where all nodes are used once and once and returns to the starting point.

    SO far i have drawn out the corresponding shortest distance table (from city to city) :
    Not sure what to do with the part saying that no subdivisions can be built between 1&4.... have that as an empty set?

    1 2 3 4 5
    ________________
    1. 0 6 1 5 9
    2. 6 0 4 1 3
    3. 1 4 0 4 3
    4. 5 1 4 0 7
    5. 9 3 3 7 0

    Presuming that step is correct i dont know where to go from here.

    Any help once again much appreciated :)

    Ian


Advertisement