<｜begin▁of▁sentence｜>### Instruction:
Given a graph with its edge set as [('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'A'), ('A', 'C'), ('B', 'D')], can you compute the load centrality for each node and explain what the load centrality indicates?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
# Add some edges
G.add_edges_from([('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'A'), ('A', 'C'), ('B', 'D')])

# Compute load centrality
load_centrality = nx.load_centrality(G, normalized=True, weight=None, cutoff=None)

# Print load centrality for each node
for node, centrality in load_centrality.items():
    print(f'Load centrality of node {node}: {centrality}')
<|EOT|>
