misk@piefed.social to Programming@programming.devEnglish · 14 days agoNew Method Is the Fastest Way To Find the Best Routeswww.quantamagazine.orgexternal-linkmessage-square11fedilinkarrow-up1120arrow-down12file-textcross-posted to: [email protected]
arrow-up1118arrow-down1external-linkNew Method Is the Fastest Way To Find the Best Routeswww.quantamagazine.orgmisk@piefed.social to Programming@programming.devEnglish · 14 days agomessage-square11fedilinkfile-textcross-posted to: [email protected]
Archive: https://archive.ph/2025.08.06-191943/https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/
minus-squareMonkderVierte@lemmy.ziplinkfedilinkarrow-up5·12 days agoThe Osmand/Organic Maps devs know about this?
minus-square𝙲𝚑𝚊𝚒𝚛𝚖𝚊𝚗 𝙼𝚎𝚘𝚠@programming.devlinkfedilinkarrow-up10·12 days agoIt’s not that useful for them. This is for calculating the shortest path from a single source to all other vertices in the graph, but for route finding you only need to know a single path.
The Osmand/Organic Maps devs know about this?
It’s not that useful for them. This is for calculating the shortest path from a single source to all other vertices in the graph, but for route finding you only need to know a single path.