<｜begin▁of▁sentence｜>### Instruction:
Given two graphs, G1 as a cycle graph of four nodes and G2 as a wheel graph of five nodes, can you compute all the minimum-cost edit paths transforming G1 into G2 using NetworkX's optimal_edit_paths function and also mention the cost of these optimal edit paths?
### Response:
import networkx as nx

# Define two graphs, G1 and G2
G1 = nx.cycle_graph(4)
G2 = nx.wheel_graph(5)

# Compute all minimum-cost edit paths transforming G1 to G2
paths, cost = nx.optimal_edit_paths(G1, G2)

print('Number of optimal edit paths:', len(paths))
print('Cost of the optimal edit paths:', cost)
<|EOT|>
