the straightest line between two random points or a grouping OF groups in an INFINTITE
domain,in my mind renders the problem immediately unquantifiable. The straightest line is sometimes the quickest way but not always,particularly given all possibilities.
Remeber that the fastest route has to be found via algorithm.I find common sense to be more efficient.in the usa with cities away from the centre makes a good map of problem at hand.Given all cities must be visited,the computation is impossible or is it? This is the question ,yes? my question was a)the route-finding or every possible permutation of every journey is sequential and systematic,like odds in Poker,at least the research.
b)the mileometer then clocks it up,using plus.IF an efficient path is found and an alternative route discovered what if a minus sign comes into use? Does that differentiate between N¬NP? Also contrast between choices...how is ¬NP defined?
the manipulation of operations could make it be seen incompatible.
Also,where is the equals sign? when do they equate?