<｜begin▁of▁sentence｜>### Instruction:
Given a complete graph with 3 nodes, can you use networkx to calculate the Eulerian circuit if the graph is Eulerian?
### Response:
import networkx as nx

# Create a graph
G = nx.complete_graph(3)

# Check if the graph is Eulerian
is_eulerian = nx.is_eulerian(G)
if is_eulerian:
  eulerian_circuit = list(nx.eulerian_circuit(G))
  print('Eulerian Circuit:', eulerian_circuit)
else:
  print('Graph is not Eulerian')
<|EOT|>
