最短経路問題
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
Article · 日本語
グラフ理論における最短経路問題（さいたんけいろもんだい、英: shortest path problem）とは、重み付きグラフの与えられた2つのノード間を結ぶ経路の中で、重みが最小の経路を求める最適化問題である。
Abstract from DBpedia / Wikipedia · CC BY-SA