ConceptSSSP / Single-Source Shortest Path
Single-Source Shortest Path
A classical computational problem in graph theory that seeks the shortest paths from a given source node to all other nodes in a graph. It is a core problem in both algorithm theory and practical engineering applications.
Timeline (last 90 days)
Sep 22
Dijkstra's algorithm has long been the standard tool for solving the single-source shortest path (SSSP) problem.
Unverified50%
Sep 22
New shortest path algorithms have proven that the SSSP problem can be solved in complexity below O(m + n log n) under specific graph models.
Unverified50%