<｜begin▁of▁sentence｜>### Instruction:
As a photojournalist, you often have to track the events and stories you cover, establishing connections among them. Let's take an instance where you documented certain events, and those events are interconnected in some way, modeled as a graph. The events would be the nodes and the connections between them would be the edges. If the connections between these events are represented as [(1, 2), (1, 3), (1, 4), (3, 4), (3, 5), (4, 5)], how would you calculate the maximum number of steps from one event to all other events using a conceptual tool like NetworkX? The resultant maximum number is technically termed as the 'eccentricity' of a node in graph theory.
### 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)])

# Compute the eccentricity of each node
ecc = nx.eccentricity(G)

print(ecc)
<|EOT|>
