3 ms·
Finding the shortest path from A to B is very much a solved problem, e.g. Dijkstra's algorithm can do it in quadratic time on arbitrary graphs. The article tri
by yorwba 8y ago
Finding the shortest path from A to B is very much a solved problem, e.g. Dijkstra's algorithm can do it in quadratic time on arbitrary graphs.
The article tries hard to pretend that the analog method presented could solve traveling salesman problems, but the actual paper only talks about ordinary shortest path problems. I don't see how it could be extended to TSP either, since it's hard to make electrons actually visit all destinations you want to cover when there's a shorter route available.