When the weight of an edge is defined as its Euclidean length raised to the power of the parameter "t" ≥ 1, the edge is present in the shortest-path graph if and only if it is the least weight path between its endpoints.