Agent Engineering
Shortest Path
A shortest path minimizes a specified total across graph edges, such as hop count or additive cost. The result depends on direction, weights and the algorithm's assumptions. There may be ties or no route at all; "shortest" does not necessarily mean fastest, cheapest in cash or operationally permitted.
Reviewed
Sources
Member lesson
The definition and sources are public. The complete practical lesson is for members.