<｜begin▁of▁sentence｜>### Instruction:
Given two graphs, G1 which is a cycle graph with 6 nodes, and G2 which is a wheel graph with 7 nodes, what is the graph edit distance between G1 and G2? The code provided calculates and prints out this distance.
### Response:
import networkx as nx

# Create two example graphs G1 and G2
def create_graph_1():
    return nx.cycle_graph(6)

def create_graph_2():
    return nx.wheel_graph(7)

# Calculate the graph edit distance between G1 and G2
G1 = create_graph_1()
G2 = create_graph_2()
ged = nx.graph_edit_distance(G1, G2)
print('Graph Edit Distance between G1 and G2:', ged)
<|EOT|>
