<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with the edge set [(0, 1), (1, 2), (2, 3), (3, 0), (2, 4), (4, 2)], determine if the graph is strongly connected using NetworkX. After removing the edge (2, 3), is the graph still strongly connected?
### Response:
import networkx as nx

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

# Add edges
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (2, 4), (4, 2)])

# Check if the graph is strongly connected
connected = nx.is_strongly_connected(G)
print('Is the graph strongly connected?', connected)

# Modify the graph by removing an edge
G.remove_edge(2, 3)

# Check strong connectivity again
connected = nx.is_strongly_connected(G)
print('Is the graph strongly connected after removing an edge?', connected)
<|EOT|>
