<｜begin▁of▁sentence｜>### Instruction:
Given a directed 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 use NetworkX to compute the number of strongly connected components?
### Response:
import networkx as nx

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

# Calculate the number of strongly connected components
n_components = nx.number_strongly_connected_components(G)

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