a salesman travel from sindth to punjab province. He may visit either n=2,3,4,5 or 6 cities of punjab. For every number of cities n he may adopt different roots.
Some roots will be longer and other shorter. Develop a Cpp program.
The line between 'helping you finish a project' and 'helping you cheat' is a fine one, at times. However, in this case the Daniweb rules are pretty straightforward:
Do provide evidence of having done some work yourself if posting questions from school or work assignments
So: Show us what you have done so far, and tell us what you are having difficulty with, and we will assist you. We will not, and cannot, provide you a solution without you showing some effort on your part.
BTW, you should know that the Travelling Salesman Problem is a classic one, with many variations, and is provably NP-complete (meaning that all the known general solutions require non-deterministic polynomial time; any solution in less than exponential time would effectively be a proof that NP = P, which is an open question to date and thought by many to be undecidable). Just so you know.
Please write in full English words -- this isn't a chatroom. There are a lot of non-native English speaking people here who have no idea what you just wrote. Finally, not much point posting an executable -- most people won't bother to intall it on their computer for fear that it may contain virus or malware.
Yes, that's what we want you to do, then ask questions about what you don't understand. We're not going to write the program for you, but help you to write it yourself. Give a man a fish and he will eat for one meal, teach a man how to fish and he will eat for life.
Need some help with this Array. I am trying to get the sum of the even numbers and the sum of the odd numbers using a for each loop. I know the answers to what I am trying to achive are sum of even = 84 and the sum of ...
I have a 2d matrix with dimension (3, n) called A, I want to calculate the normalization and cross product of two arrays (b,z) (see the code please) for each column (for the first column, then the second one and so on).
the function that I created to find the ...