# A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

> When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant refining it to finding…

- **Source:** [SlashGear](https://www.slashgear.com/2014867/new-algorithm-beats-dijkstra-time-shortest-path-to-network/?utm_source=gearopen.com&utm_medium=referral&utm_campaign=feed&utm_content=690e14609f7a29d0597a7bad)
- **Published:** 2025-11-07
- **Category:** Science
- **Tags:** #algorithm #shortest #dijkstra #path #beats #network #nodes #point
- **Canonical:** http://localhost:4321/a/690e14609f7a29d0597a7bad

---

_GearOpen's distilled summary. The full original article is published at SlashGear (source link above); GearOpen does not republish the source's full text._