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
- Image
- Shortest path with direct weights.svg
Sources (3)
via Wikidata · CC0
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
Q12013
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
Q118398
Entity