<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with nodes x, a, b, c, d, e, y and directed edges with capacities as such: ('x', 'a', 3.0), ('x', 'b', 1.0), ('a', 'c', 3.0), ('b', 'c', 5.0), ('b', 'd', 4.0), ('d', 'e', 2.0), ('c', 'y', 2.0), ('e', 'y', 3.0), what is the value of the minimum cut between source node 'x' and sink node 'y'?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()

# Add edges with capacity to the graph
G.add_edge('x', 'a', capacity=3.0)
G.add_edge('x', 'b', capacity=1.0)
G.add_edge('a', 'c', capacity=3.0)
G.add_edge('b', 'c', capacity=5.0)
G.add_edge('b', 'd', capacity=4.0)
G.add_edge('d', 'e', capacity=2.0)
G.add_edge('c', 'y', capacity=2.0)
G.add_edge('e', 'y', capacity=3.0)

# Compute the value of the minimum (s, t)-cut
min_cut_val = nx.minimum_cut_value(G, 'x', 'y')
print(min_cut_val)
<|EOT|>
