<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edge set [(0, 0), (0, 1), (0, 2), (1, 2), (2, 0), (2, 1), (2, 2)], which includes a self-loop and parallel edges, how can you find all the simple cycles using NetworkX?
### Response:
import networkx as nx

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

# Add edges (including a self-loop and parallel edges)
G.add_edges_from([(0, 0), (0, 1), (0, 2), (1, 2), (2, 0), (2, 1), (2, 2)])

# Find simple cycles
list_of_cycles = list(nx.simple_cycles(G))

print('All simple cycles in the graph:', sorted(list_of_cycles))
<|EOT|>
