#shortestpath

Jan :rust: :ferris:janriemer@floss.social
2025-12-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:

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

Aljoscha Rittner (beandev)beandev@social.tchncs.de
2025-09-03

New Method Is the Fastest Way To Find the Best Routes

quantamagazine.org/new-method-

> 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

2025-08-18

Questa è grossa: un nuovo algoritmo per trovare il percorso più breve tra due punti di un grafo quantamagazine.org/new-method- #shortestpath #dijkstra

Eric Maugendre about datamaugendre@hachyderm.io
2025-08-11

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."

quantamagazine.org/new-method-

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

N-gated Hacker Newsngate
2025-05-08

šŸš€ Behold, the revolutionary Yggdrasil: a "decentralized" 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? šŸ™„
yggdrasil-network.github.io/ab

Mohammad HajiaghayiMTHajiaghayi@mathstodon.xyz
2023-07-19

šŸ“¢ Join now (7pm ET Wed) to watch Lesson 25: Introduction to Algorithms by Mohammad Hajiaghayi: šŸ“š"#BellmanFord for #shortestpath, #Prim for #minimumspanningtree #MST and #NPcompleteness"
šŸ“·youtu.be/-BL3xSW8Eds . Subscribe to YouTube @hajiaghayi for future lessons!)

Mohammad HajiaghayiMTHajiaghayi@mathstodon.xyz
2023-07-19

šŸ“¢ 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: youtu.be/GE8Zo-x-Ynk . Subscribe to YouTube @hajiaghayi for future lessons!)

Pustam | ą¤Ŗą„ą¤øą„ą¤¤ą¤® | ą¦Ŗą§ą¦øą§ą¦¤ą¦®šŸ‡³šŸ‡µpustam_egr@mathstodon.xyz
2023-01-21

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 šŸ‘‰ šŸ”— cantorsparadise.com/dijkstras-

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

2022-11-15

#arxivfeed :

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

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

2020-01-16

(PDF) FPGA-based Acceleration of Shortest Path Computation
ntu.edu.sg/home/asgeorge/pdf/J

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

2020-01-15

(PDF) Parallel Implementation of Dijkstra's Algorithm in FPGA
semanticscholar.org/paper/Para

Ariel Faria, Michelle Valente, Utkarsh Gupta, andVeton Saliu Department of Electrical Engineering
Columbia University in the City of New York, New York

This report discusses our project’s design to speed up Dijkstra’s shortest path finding algorithm on FPGA.

Client Info

Server: https://mastodon.social
Version: 2025.07
Repository: https://github.com/cyevgeniy/lmst