مسألة المسار الأقصر

Also 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