✳flâneur — a map of the web's best reading

Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazine

quantamagazine.org · 2,331 words · saved by 1 readers

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure, and your fastest route becomes the slowest. Scenarios like this are also a challenge for researchers who develop algorithms, the step-by-step procedures that computers use to solve problems. Many different algorithms can solve any given problem, and the question of which is best can be frustratingly ambiguous. For example, imagine an algorithm that’s designed to find the fastest route between two points. There are lots of possible ways to design such an algorithm so that it doesn’t fail. A successful algorithm will always return the fastest route, whether you use it in London or Los Angeles, and whether it’s rush hour or the middle of the night. But those algorithms aren’t all the same. The time each one takes to find the right answer will vary depending on where and when it’s used, and

Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazine Home Computer Scientists Establish the Best Way to Traverse a Graph Read Later Share Copied! Comments Read Later Read Later algorithms Computer Scientists Establish the Best Way to Traverse a Graph By Ben Brubaker October 25, 2024 Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.” Read Later Dave Whyte for Quanta Magazine Introduction By Ben Brubaker Staff Writer October 25, 2024 View PDF/Print Mode algorith

Explore this link on the map →

saved by

related reading