<｜begin▁of▁sentence｜>### Instruction:
{'description': 'Given a graph whose edge set is [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3)], can you compute the average global efficiency using NetworkX?', 'problem': 'The code snippet computes the average global efficiency of a simple undirected graph. Here, the graph is defined with nodes 0-3, and it forms a complete graph without self-loops. The average global efficiency is calculated as the average inverse shortest path distance between all pairs of nodes.'}
### Response:
import networkx as nx

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

# Compute the average global efficiency
efficiency = nx.global_efficiency(G)

print('Average global efficiency:', round(efficiency, 12))
<|EOT|>
