<｜begin▁of▁sentence｜>### Instruction:
As a Retail Buyer selecting merchandise for retail stores, imagine you're tasked with optimizing the distribution of goods from the supplier to the final destination. You have a network of warehouses (vertices) interconnected by roads (edges) with varying capacities. Using the "maxflow" function in the network optimization software, you need to determine the maximum flow of goods from the main distribution center (vertex 0) to a specific retail outlet (vertex 3). Each road has a designated capacity reflecting its ability to handle goods, and you must ensure that the chosen path efficiently utilizes these capacities while meeting the demand at the destination.
### Response:
from igraph import Graph

# Create a graph with directed edges and a 'capacity' attribute
edges = [(0, 1), (0, 2), (1, 2), (1, 3), (2, 3)]
capacities = [10, 5, 10, 5, 10]
g = Graph(edges=edges, directed=True)
g.es['capacity'] = capacities

# Calculate the maximum flow from vertex 0 to vertex 3
max_flow = g.maxflow(0, 3, capacity=g.es['capacity'])

# Print the result
print('The maximum flow from vertex 0 to vertex 3 is:', max_flow.value)
<|EOT|>
