Johnson's algorithm
Description: A graph algorithm for finding shortest paths between every pair of vertices in a sparse, weighted, directed graph.
Primary topic: Scheduling and Optimization Algorithms (47%)
Wikidata ID: wiki/Q2345824
OpenAlex ID: keywords/johnson-s-algorithm
