<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 1), (1, 2), (2, 3), (3, 0), (2, 4), (4, 2), (4, 5), (5, 6), (6, 4)], can you find the strongly connected components using NetworkX's recursive method and list them, sorted by size in descending order?
### Response:
import networkx as nx

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

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

# Print the sorted list of strongly connected components
for component in strongly_connected_components:
    print('Component size:', len(component), 'Nodes:', component)
<|EOT|>
