3 ms·
I still think your last statement is unfair. At worst, the caveat is that the TSP solution is for any graph within a certain class of topologies. Concurrent re
by naasking 10y ago
I still think your last statement is unfair. At worst, the caveat is that the TSP solution is for any graph within a certain class of topologies.
Concurrent revisions in particular has been implemented to work in concurrent, parallel and incremental computing, with no change in semantics. So it's pretty darn close to a magic wand, but it can't violate the laws of logic.