Traveling Salesman Problem is NP Hard

I drew this simplified representation of the problem space to explain to my traveling companions the difficulty our travel agent was having in finding the cheapest route that fit our criteria (departure dates, etc) within a timely manner.
Comments (3)
almost illegible. zero eprops -_-
@BethXnesS -
how dare you! oh.. you already did.
HAHAHA bethany! aw it's ok jtsai. but i have to agree. this simplified is about as simple as simplified chinese.
Comments are closed.