{"id":638,"date":"2023-01-11T08:45:06","date_gmt":"2023-01-11T16:45:06","guid":{"rendered":"http:\/\/fx-td.com\/houdiniandchill\/?p=638"},"modified":"2023-01-11T08:48:20","modified_gmt":"2023-01-11T16:48:20","slug":"archived-post-by-paqwak-5","status":"publish","type":"post","link":"http:\/\/fx-td.com\/houdiniandchill\/2023\/01\/11\/archived-post-by-paqwak-5\/","title":{"rendered":"Archived post by PaqWak"},"content":{"rendered":"<div class=\"postie-post\">\n<p class=\"\">So I was looking for a way to find the longest path in a network of edges, like the opposite from what the &#8216;find shortest path&#8217; does. I remember looking for a solution previously without succes. So I asked Skynet (Chat-GPT), and here&#8217;s his solution :<\/p>\n<p class=\"\">\n<p class=\"\">The doc don&#8217;t mention that, actually the shortest path OP complain about the negative weight &#8230; but it indeed output the longest path as far as I can tell \ud83e\udd73<\/p>\n<p>Attachments in this post: <br \/><a href=\"http:\/\/fx-td.com\/houdiniandchill\/wp-content\/uploads\/discord\/20234501\/11\/23\/image.png\">http:\/\/fx-td.com\/houdiniandchill\/wp-content\/uploads\/discord\/20234501\/11\/23\/image.png<\/a><\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>So I was looking for a way to find the longest path in a network of edges, like the opposite from what the &#8216;find shortest path&#8217; does. I remember looking for a solution previously without succes. So I asked Skynet (Chat-GPT), and here&#8217;s his solution : The doc don&#8217;t mention that, actually the shortest path &hellip; <a href=\"http:\/\/fx-td.com\/houdiniandchill\/2023\/01\/11\/archived-post-by-paqwak-5\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Archived post by PaqWak<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[2],"tags":[],"_links":{"self":[{"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/posts\/638"}],"collection":[{"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/comments?post=638"}],"version-history":[{"count":0,"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/posts\/638\/revisions"}],"wp:attachment":[{"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/media?parent=638"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/categories?post=638"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/fx-td.com\/houdiniandchill\/wp-json\/wp\/v2\/tags?post=638"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}