Reference no: EM131585811

Question: Find a network flow in Example in which both cars travel along the same route.

Example: It is a little-known fact that ducks love pizza. (Note: not actually true.) On Take-Your-Duck-to-Dinner night, several students who live in the same dorm decide to take their ducks to the pizza place. There are too many students and ducks for a single car, so they take two cars. Figure shows local streets and alleyways represented as edges on a graph (the vertices are intersections), with the number of pizza-place-ward lanes given as edge weights. The circled numbers represent the number of cars traveling simultaneously on the streets they label. As you can see from the figure, the two cars take different routes to the pizza place. We think of the traffic as flowing from the dorm to the pizza place.