<｜begin▁of▁sentence｜>### Instruction:
Imagine you're putting together a new excursion package for a group of intrepid travelers, where they'll be exploring a network of six picturesque villages connected by charming footpaths. The connections between the villages are as follows: a path from Village 1 to Village 2, one from Village 1 to Village 3, another from Village 1 to Village 4, a scenic trail between Village 3 and Village 4, a trek from Village 3 to Village 5, and lastly, a path connecting Village 4 and Village 5.

To ensure the best experience for your guests, you want to identify the longest distance someone would have to travel between any two villages without retreading their steps. To put it in tour operator terms, could you calculate the "maximum distance between any two points of interest" in this network of villages using NetworkX? This measurement is known to network savvy folks as the 'diameter' of a graph.
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(1, 2), (1, 3), (1, 4), (3, 4), (3, 5), (4, 5)])

# Calculate the diameter
print('The diameter of the graph:', nx.diameter(G))
<|EOT|>
