Buy Me a Coffee at ko-fi.com

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

Pronunciation
/ˈʃɔrtɪst pæθ ˈprɑbləm/
/ʃɔːtɪst pɑːθ ˈprɒbləm/