SSSP problem
Материал из WEGA
SSSP problem --- задача о кратчайшем пути. This is the single-source shortest path problem. Given a digraph with non-negative arc weights, Dijkstra's algorithm takes [math]\displaystyle{ {\mathcal O}(n^{2}) }[/math] time. An implementation of Dijkstra's algorithm that uses Fibonacci heaps reduced the time to [math]\displaystyle{ {\mathcal O}(n \log n + m) }[/math].
