Jan  Dec 23

@AlSweigart ...or, when we talk about Dijkstra's algorithm, why not make it O(m log^(2/3) n)!? 😜

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths:

https://arxiv.org/abs/2504.17033

To achieve this, the researchers _combine_ Dijkstra’s algorithm with Bellman-Ford algorithm - incredible stuff! 🤓

@shanecelis

#Algorithm #Algorithms #Paper #ShortestPath #Dijkstra

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

We give a deterministic $O(m\log^{2/3}n)$-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition model. This is the first result to break the $O(m+n\log n)$ time bound of Dijkstra's algorithm on sparse graphs, showing that Dijkstra's algorithm is not optimal for SSSP.

arXiv.org
Aljoscha Rittner (beandev)Sep 3, 2025

New Method Is the Fastest Way To Find the Best Routes

https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/

> A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

#mathematics #algorithms #shortestpath

New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Quanta Magazine
ildaveAug 18, 2025
Questa è grossa: un nuovo algoritmo per trovare il percorso più breve tra due punti di un grafo https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/ #shortestpath #dijkstra
New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Quanta Magazine
Eric Maugendre about dataAug 11, 2025

The new algorithm for directed cheapest routes "slices the graph into layers, moving outward from the source like Dijkstra’s. But rather than deal with the whole frontier at each step, it uses the Bellman-Ford algorithm to pinpoint influential nodes, moves forward from these nodes to find the shortest paths to others, and later comes back to other frontier nodes. It doesn’t always find the nodes within each layer in order of increasing distance, so the sorting barrier doesn’t apply. And if you chop up the graph in the right way, it runs slightly faster than the best version of Dijkstra’s algorithm. It’s considerably more intricate, relying on many pieces that need to fit together just right. But curiously, none of the pieces use fancy mathematics."

https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/

#graphTheory #shortestPath #navigation #networks #computing #CS #computerScience #algorithmics #algorithmic #algorithms #algorithm

New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Quanta Magazine
N-gated Hacker NewsMay 8, 2025
🚀 Behold, the revolutionary Yggdrasil: a "decentralized" #network that promises to find the shortest path in life, yet ironically takes the longest route to explain itself. 🌐 Because who doesn't want to spend hours setting up peering connections for an "experimental" adventure into network obscurity? 🙄
https://yggdrasil-network.github.io/about.html #Yggdrasil #Decentralization #ShortestPath #ExperimentalTech #NetworkSetup #HackerNews #ngated
About

End-to-end encrypted IPv6 networking to connect worlds

Yggdrasil Network
Mohammad HajiaghayiJul 19, 2023
📢 Join now (7pm ET Wed) to watch Lesson 25: Introduction to Algorithms by Mohammad Hajiaghayi: 📚"#BellmanFord for #shortestpath, #Prim for #minimumspanningtree #MST and #NPcompleteness"
📷https://youtu.be/-BL3xSW8Eds . Subscribe to YouTube @hajiaghayi for future lessons!)
Lesson 25: Introduction to Algorithms by Mohammad Hajiaghayi: Bellman-Ford, Prim and NP-completeness

YouTube
Mohammad HajiaghayiJul 19, 2023
📢 Join now (7pm ET Wed) to watch Lesson 24: Introduction to Algorithms by Mohammad Hajiaghayi! 📚 "#Dijkstra #Singlesource #shortestpath and its proof by #induction." 🎥Watch here: https://youtu.be/GE8Zo-x-Ynk . Subscribe to YouTube @hajiaghayi for future lessons!)
Lesson 24: Introduction to Algorithms by Mohammad Hajiaghayi: Dijkstra Single-source Shortest Path

YouTube
Pustam | पुस्तम | পুস্তম🇳🇵Jan 21, 2023

From GPS navigation to network-layer link-state routing, Dijkstra’s Algorithm powers some of the most taken-for-granted modern services.

"Dijkstra’s Shortest Path Algorithm in Python" by Micah Shute 👉 🔗 https://www.cantorsparadise.com/dijkstras-shortest-path-algorithm-in-python-d955744c7064

#ShortestPath #Algorithm #ShortestPathAlgorithm #Python #Dijkstra #GPS #Network #Navigation #GPSNavigation #CantorsParadise

Dijkstra’s Shortest Path Algorithm in Python - Cantor’s Paradise

From GPS navigation to network-layer link-state routing, Dijkstra’s Algorithm powers some of the most taken-for-granted modern services. Utilizing some basic data structures, let’s get an…

Cantor’s Paradise
Dominic BoutetNov 15, 2022

#arxivfeed :

"Comparing models of information transfer in the structural brain network and their relationship to functional connectivity: Diffusion versus shortest path routing"
https://www.biorxiv.org/content/10.1101/2022.11.11.515707v1

#neuroscience #neuro #brain #network #connectome #connectivity #graph #GraphTheory #DTI #fMRI #DiffusionModel #ShortestPath

@hJan 16, 2020

(PDF) FPGA-based Acceleration of Shortest Path Computation
https://www.ntu.edu.sg/home/asgeorge/pdf/J11.pdf

by Jagadeesh, Srikanthan, and Lim
Centre for High Performance Embedded Systems, Singapore

#fpga #graphtheory #graph #dijkstra #shortestpath #algorithm #embedded