<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph whose edge set includes reciprocal edges [('A', 'B'), ('B', 'A')], [('B', 'C'), ('C', 'B')] and non-reciprocal edges [('C', 'D'), ('D', 'E')], how can you compute the overall reciprocity of the graph using NetworkX?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()

# Add edges (some edges are added in both directions to create reciprocity)
G.add_edge('A', 'B')
G.add_edge('B', 'A') # Reciprocal of A -> B
G.add_edge('B', 'C')
G.add_edge('C', 'B') # Reciprocal of B -> C
G.add_edge('C', 'D')
G.add_edge('D', 'E')

# Compute the overall reciprocity of the graph
reciprocity = nx.overall_reciprocity(G)

print('Overall reciprocity of the graph:', reciprocity)
<|EOT|>
