<｜begin▁of▁sentence｜>### Instruction:
I have a graph with 5 nodes labeled A, B, C, D, E, which forms a cycle plus two additional diagonal edges (A-C and B-D). How can I use NetworkX to compute and display the edge load centrality for each edge in the graph?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()

# Add nodes to the graph
G.add_nodes_from(['A', 'B', 'C', 'D', 'E'])

# Add edges to the graph
G.add_edges_from([('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'E'), ('E', 'A'), ('A', 'C'), ('B', 'D')])

# Compute the edge load centrality
edge_load = nx.edge_load_centrality(G)

# Print the edge load centrality for each edge
for edge in edge_load:
    print(f'Edge {edge}: {edge_load[edge]}')
<|EOT|>
