Per Vognsen on Nostr: There's a very nice approach to A* via potential functions which also situates it ...

There's a very nice approach to A* via potential functions which also situates it among modern graph algorithms for problems like k shortest paths. I first learned about this from nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqhyqvr64x2qh4jkkg6z5c7ep7gsjpvcrghd0amn9pvv8krhgk3mwqzdzccc (nprofile…zccc)'s old blog but it doesn't seem to have propagated widely into textbooks or classrooms: https://11011110.github.io/blog/2008/04/03/reweighting-graph-for.html