I don't understand why you would say that. Shortest Path Algorithm has well known heuristics. If all you want is "close enough" then sure, you can compute quic

I don't understand why you would say that. Shortest Path Algorithm has well known heuristics. If all you want is "close enough" then sure, you can compute quickly. But when that route corresponds to how much you spend on fuel to complete your route, usually you want to use something better than "good enough". This, as with Soap Bubble computation, only really shows it can reach local minima, not global minima, which is really what most people care about.