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

G = nx.DiGraph([(0,1), (1,2), (2,0), (2,3), (4,5), (3,4), (5,6), (6,3), (6,7)])

num_strongly_connected = nx.number_strongly_connected_components(G)
print('Number of strongly connected components:', num_strongly_connected)
<|EOT|>
