shortest path problem
Sign in to saveAlso known as single-pair shortest path problem
problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Wikidata facts
- Instance of
- computational problem
- Image
- Shortest path with direct weights.svg
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0