<｜begin▁of▁sentence｜>### Instruction:
Given an undirected complete graph of with nodes, can you find an Eulerian circuit starting at node 1 and list the edges in it?
### Response:
import networkx as nx

# Create an undirected graph
G = nx.complete_graph(3)

# Compute an Eulerian circuit in the graph starting at node 1
circuit = list(nx.eulerian_circuit(G, source=1))

# Print the edges in the Eulerian circuit
print('Eulerian circuit:', circuit)
<|EOT|>
