<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph whose edge set is [('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'A')], how can you remove the edge from node 'B' to 'C' using NetworkX and then draw the graph without that edge?
### Response:
import networkx as nx

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

# Add some edges
e = [('A', 'B'), ('B', 'C'), ('C', 'D'), ('D', 'A')]
G.add_edges_from(e)

# Hide the edges from node 'B' to 'C'
G.remove_edge('B', 'C')

# Draw the graph excluding the removed edge
nx.draw(G, with_labels=True)
<|EOT|>
