A farmer wishes to transport a truckload of eggs from one city to another city through a given road network. The truck will incur a certain amount of breakage on each road segment; let wij denote the fraction of the eggs broken if the truck traverses the road segment (i, j). How should the truck be routed to minimize the total breakage? How would you formulate this problem as a shortest path problem.