<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with its edge set [(0, 1), (1, 2), (2, 0), (3, 4), (4, 5), (5, 3), (2, 3)], how do you determine the strongly connected components in this graph using NetworkX?
### Response:
import networkx as nx

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

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

# Generate a sorted list of strongly connected components, largest first
components = sorted(nx.strongly_connected_components(G), key=len, reverse=True)

# Output the sorted list of components
print('Strongly connected components:', [list(c) for c in components])
<|EOT|>
