What is the shortest path from starting point to endpoint called?

The shortest path from a starting point to an endpoint is commonly referred to as the "optimal path" or "shortest path." In graph theory, this concept is often solved using algorithms like Dijkstra's or A* to determine the least-cost route between two nodes. This path minimizes distance, time, or other cost metrics, depending on the context.