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
Facts
1 property- Instance of
- computational problem
🏷️ Also known as
en shortest path problem
en single-pair shortest path problem
ar مسألة المسار الأقصر
ar مسألة أقصر طريق
de APSP
de Shortest Path
de Shortest-Path
de SSSP
de Kürzester-Weg-Problem
de Kürzeste-Pfad-Problem
de Kürzester Pfad
de Kürzester Weg
es problema de los caminos mas cortos
es problema del camino mas corto
es problema del camino más corto
es problema de los caminos más cortos
fa مسألۀ یافتن کوتاهترین مسیر
fa مسئله یافتن کوتاه ترین مسیر
fa مسئله یافتن کوتاهترین مسیر
fa مسئلهٔ یافتن کوتاهترین مسیر
🔖 Identifiers · 9
- GND ID
- 4138403-9
- OpenAlex ID
- C22590252
- Image (Wikimedia Commons)
- Shortest path with direct weights.svg ↗
- Dictionary of Algorithms and Data Structures ID
- singlepairShortestpathProblem, shortestpath
- Encyclopædia Britannica Online ID
- topic/shortest-path-problem
- Freebase ID
- /m/0bjw6
- MathWorld ID
- ShortestPathProblem
- Microsoft Academic ID (discontinued)
- 22590252
- Yale LUX ID
- concept/20f81b3b-453f-47f4-87ba-7b252da0431f
🔗 Connections
← Computes solution to 6
Examples 1
Instance of 1
Maintained by WikiProject 1
Press Enter · cited answer in seconds
0 sources
Summary
shortest path problem is a computational problem[1].