<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges set as [(0, 1), (1, 2), (2, 0), (2, 3), (3, 4), (4, 2)], can you use NetworkX to find all the simple cycles in the graph?
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
# Add edges
G.add_edges_from([(0, 1), (1, 2), (2, 0), (2, 3), (3, 4), (4, 2)])
# Find simple cycles
print(list(nx.simple_cycles(G)))
<|EOT|>
