Dijkstra’s algorithm won’t be replaced in production routers any time soon

Researchers have found a new approach to finding shortest paths, but it's complex Systems Approach Last year a couple of ...
SlashGear

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

New Sorting Algorithm Breakthrough is Better than Dijkstra

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...
GIGAZINE

'Algorithm Visualizer', a site where you can visually display algorithms and check them with code

When an algorithm is displayed in a program, it is difficult to imagine the program of the algorithm to be executed because the concept of the algorithm itself is complicated and partly because of ...