<｜begin▁of▁sentence｜>### Instruction:
Ladies and gentlemen, as we traverse the illustrious pathways of our historical graph theory garden, allow me to present a small puzzle that merges the charm of our tour with the elegance of mathematical structures. Imagine our journey has led us to two seemingly different maps of our garden's layout. The first map, which we will affectionately call 'Map Alpha', reveals a trio of pathways connecting points of interest: one from the Fountain of Unity (Point 1) to the Grove of Enlightenment (Point 2), the second from the Grove to the Pavilion of Reflection (Point 3), and the third completing the circuit back to the Fountain. 

Now, hold that image in your minds as we look at the second map, 'Map Beta', which at first glance appears to have the same points of interest but with the paths in a different order. It shows the pathway leading from the Pavilion back to the Fountain, then from the Fountain to the Grove, and finally from the Grove to the Pavilion once more.

Our delightful quandary for today is to ascertain whether 'Map Alpha' and 'Map Beta' are in fact identical in the context of our journey through the gardens, regardless of the sequence in which these routes are listed. So let us ponder, dear guests, do these represent the very same paths between our cherished landmarks? Keep this intriguing thought with you as we continue our tour and feel free to share your insights with me as we move on to our next destination!
### Response:
import networkx as nx

# Define two sets of edges
edges1 = [(1, 2), (2, 3), (3, 1)]
edges2 = [(3, 1), (1, 2), (2, 3)]

# Use edges_equal to determine if the edge sets are equal
are_equal = nx.utils.edges_equal(edges1, edges2)

print('The edges are equal:', are_equal)
<|EOT|>
