{"id":6144,"date":"2025-08-18T07:04:40","date_gmt":"2025-08-18T07:04:40","guid":{"rendered":"https:\/\/mailitics.com\/index.php\/2025\/08\/18\/dijkstra_defeated_new_shortest_path_algorithm\/"},"modified":"2025-08-18T07:04:40","modified_gmt":"2025-08-18T07:04:40","slug":"dijkstra_defeated_new_shortest_path_algorithm","status":"publish","type":"post","link":"https:\/\/mailitics.com\/index.php\/2025\/08\/18\/dijkstra_defeated_new_shortest_path_algorithm\/","title":{"rendered":"Dijkstra defeated: New Shortest Path Algorithm revealed"},"content":{"rendered":"<p>    Dijkstra defeated: New Shortest Path Algorithm revealed<br \/>\n \t<BR><br \/>\n<BR><\/BR><br \/>\n    <!-- no image --><br \/>\n \t<BR><br \/>\n<BR><\/BR><\/p>\n<div>\n<!-- SC_OFF --><\/p>\n<div class=\"md\">\n<p>Dijkstra, the goto shortest path algorithm (time complexity nlogn) has now been outperformed by a new algorithm by top Chinese University which looks like a hybrid of bellman ford+ dijsktra algorithm.<\/p>\n<p>Paper : <a href=\"https:\/\/arxiv.org\/abs\/2504.17033\">https:\/\/arxiv.org\/abs\/2504.17033<\/a><\/p>\n<p>Algorithm explained with example : <a href=\"https:\/\/youtu.be\/rXFtoXzZTF8?si=OiB6luMslndUbTrz\">https:\/\/youtu.be\/rXFtoXzZTF8?si=OiB6luMslndUbTrz<\/a><\/p>\n<\/p><\/div>\n<p><!-- SC_ON -->   submitted by   <a href=\"https:\/\/www.reddit.com\/user\/Technical-Love-8479\"> \/u\/Technical-Love-8479 <\/a> <br \/> <span><a href=\"https:\/\/www.reddit.com\/r\/datascience\/comments\/1msw56a\/dijkstra_defeated_new_shortest_path_algorithm\/\">[link]<\/a><\/span>   <span><a href=\"https:\/\/www.reddit.com\/r\/datascience\/comments\/1msw56a\/dijkstra_defeated_new_shortest_path_algorithm\/\">[comments]<\/a><\/span>\n<\/div>\n<p> \t<BR><br \/>\n <BR><\/BR><br \/>\n    \/u\/Technical-Love-8479<br \/>\n \t<BR><br \/>\n<BR><\/BR><br \/>\n<a href=\"https:\/\/www.reddit.com\/r\/datascience\/comments\/1msw56a\/dijkstra_defeated_new_shortest_path_algorithm\/\">Go to original source<\/a><br \/>\n \t<BR><br \/>\n <BR><\/BR><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Dijkstra defeated: New Shortest Path Algorithm revealed Dijkstra, the goto shortest path algorithm (time complexity nlogn) has now been outperformed by a new algorithm by top Chinese University which looks like a hybrid of bellman ford+ dijsktra algorithm. Paper : https:\/\/arxiv.org\/abs\/2504.17033 Algorithm explained with example : https:\/\/youtu.be\/rXFtoXzZTF8?si=OiB6luMslndUbTrz submitted by \/u\/Technical-Love-8479 [link] [comments] \/u\/Technical-Love-8479 Go to [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[62,99],"tags":[778,3526,309],"class_list":["post-6144","post","type-post","status-publish","format-standard","hentry","category-aimldsaimlds","category-datascience","tag-algorithm","tag-dijkstra","tag-new"],"_links":{"self":[{"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/posts\/6144"}],"collection":[{"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/comments?post=6144"}],"version-history":[{"count":0,"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/posts\/6144\/revisions"}],"wp:attachment":[{"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/media?parent=6144"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/categories?post=6144"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mailitics.com\/index.php\/wp-json\/wp\/v2\/tags?post=6144"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}