So I was looking for a way to find the longest path in a network of edges, like the opposite from what the ‘find shortest path’ does. I remember looking for a solution previously without succes. So I asked Skynet (Chat-GPT), and here’s his solution :
The doc don’t mention that, actually the shortest path OP complain about the negative weight … but it indeed output the longest path as far as I can tell 🥳
Attachments in this post:
http://fx-td.com/houdiniandchill/wp-content/uploads/discord/20234501/11/23/image.png
