最短経路問題
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
In the Vinony graph
Vinony's link graph records 331 inbound references to 最短経路問題, and connects out to Dijkstra's algorithm, A* search algorithm and Bellman–Ford algorithm.
Vinony files it under Computational problems in graph theory, Edsger W. Dijkstra and Graph distance.
Vinony links it to 24 Wikipedia language editions.
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
Connections
Dijkstra's algorithm
Entity
A* search algorithm
Entity
Bellman–Ford algorithm
Entity
transport
Entity
International Standard Book Number
Entity
function
Entity
computer network
Entity
Rubik's Cube
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Google Maps
Entity
robotics
Entity
sequence
Entity
Edsger W. Dijkstra
Entity
graph theory
Entity
OCLC, Inc.
Entity
Institute of Electrical and Electronics Engineers
Entity
graph
Entity
bibcode
Entity
arXiv
Entity