<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (1, 2), (2, 0), (2, 3), (4, 5), (3, 4), (5, 6), (6, 3), (6, 7)], can you compute the number of strongly connected components using NetworkX?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
# Add edges
e = [(0, 1), (1, 2), (2, 0), (2, 3), (4, 5), (3, 4), (5, 6), (6, 3), (6, 7)]
G.add_edges_from(e)

# Compute the number of strongly connected components
num_scc = nx.number_strongly_connected_components(G)

print('Number of strongly connected components:', num_scc)
<|EOT|>
