<｜begin▁of▁sentence｜>### Instruction:
Given a graph that forms a cycle with three nodes and has one extra node attached to one of the cycle's nodes, how can we compute the node connectivity between all pairs of nodes?
### Response:
import networkx as nx
import pprint

# Create a graph
G = nx.cycle_graph(3)
G.add_edge(2, 3)

# Compute node connectivity between all pairs of nodes in G
K = nx.all_pairs_node_connectivity(G)

# Print the result using pprint for nice formatting
pprint.pprint(K)
<|EOT|>
