<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2, 6), (1, 3, 2), (2, 3, 1), (2, 4, 7), (3, 5, 9), (4, 5, 3)], can you compute the maximum weight matching of the graph using NetworkX?
### Response:
import networkx as nx

# Create a weighted graph
G = nx.Graph()

# Add weighted edges
edges = [(1, 2, 6), (1, 3, 2), (2, 3, 1), (2, 4, 7), (3, 5, 9), (4, 5, 3)]
G.add_weighted_edges_from(edges)

# Compute the maximum weight matching
matching = nx.max_weight_matching(G, maxcardinality=False, weight='weight')

# Print the matching
print(f'The maximum weight matching is: {matching}')
<|EOT|>
