<｜begin▁of▁sentence｜>### Instruction:
In the process of analyzing a network of financial transactions, where the nodes represent individual accounts and the edges denote transactions between these accounts, we've identified a set of interactions: transactions occurred between accounts 1 and 2, 1 and 3, 1 and 4, 3 and 4, 3 and 5, as well as between 4 and 5. To enhance our investigative techniques and predict the reach of a potential fraudulent activity within this network, could you determine the minimum number of steps that would be required for information—or, in our case, a suspicious activity—to spread from the most central account to any other account in the network? This measure is known as the "radius" in network analysis. Utilizing NetworkX for this computation would provide us with valuable insight into the robustness and vulnerability of the network structure we're examining.
### 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 radius of the graph
radius = nx.radius(G)
print('Radius of graph:', radius)
<|EOT|>
