<｜begin▁of▁sentence｜>### Instruction:
As an archaeologist studying the ancient pathways that connected the settlements of a bygone civilization, we've deciphered a map fragment containing the routes between important sites, represented by a network of paths. The sites are connected as follows: from Site 0 to Site 1, Site 1 to Site 2, Site 2 to Site 3, and Site 3 back to Site 0. To understand the travel sequences that were possible without retracing steps, could we consult the scholars of NetworkX to verify whether this map depicts a path akin to those used by messengers of the past, specifically an Eulerian path where each road is traversed exactly once?
### Response:
import networkx as nx

# Create a graph with an Eulerian path
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0)])

# Check if the graph has an Eulerian path
has_path = nx.has_eulerian_path(G)

print('Does G have an Eulerian path?', has_path)
<|EOT|>
