Shortest Paths and Constraints

The choice of shortest path algorithm depends on the weight structure: Dijkstra for non-negative edges, Bellman-Ford for arbitrary weights, Floyd-Warshall for all pairs. This is foundational for routing and logistics