shortest path problem (Q1058754)
Jump to navigation
Jump to search
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
- single-pair shortest path problem
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
|
Statements
Identifiers
Sitelinks
Wikipedia(23 entries)
- arwiki مسألة المسار الأقصر
- cawiki Problema del camí més curt
- dewiki Kürzester Pfad
- enwiki Shortest path problem
- eswiki Problema del camino más corto
- fawiki مسئله یافتن کوتاهترین مسیر
- frwiki Problème de plus court chemin
- idwiki Masalah lintasan terpendek
- itwiki Cammino minimo
- jawiki 最短経路問題
- kowiki 최단 경로 문제
- ltwiki Trumpiausio kelio problema
- mswiki Jarak terpendek
- plwiki Problem najkrótszej ścieżki
- ptwiki Problema do caminho mínimo
- ruwiki Задача о кратчайшем пути
- srwiki Problem najkraćeg puta
- thwiki ปัญหาวิถีสั้นสุด
- trwiki En kısa yol problemi
- ukwiki Задача про найкоротший шлях
- urwiki کمترین رستہ الخوارزم
- viwiki Bài toán đường đi ngắn nhất
- zhwiki 最短路问题