<｜begin▁of▁sentence｜>### Instruction:
As an ecotourism guide, I have crafted a trail map for an educational nature walk, intended to promote awareness about local ecosystems. This map is represented digitally by a network of paths, analogous to nodes and edges in a graph. Some paths loop back on themselves, which I've noted to highlight self-sustaining ecosystems. I've encoded the map's pathway system in a digital graph format, with specific paths such as the circular eco-loop (1,1) and the direct migration route (1,2). Could we identify the circular eco-loops in this system to prioritize discussions on ecosystems that thrive independently? The trail system's pathways are charted in a GML file named "EcoTrailMap.gml" for ease of analysis and reference.
### Response:
import networkx as nx

# Create a graph of your preferred type
G = nx.MultiGraph()

# Add selfloop and non-selfloop edges
ekey = G.add_edge(1, 1)
ekey = G.add_edge(1, 2)

# Use selfloop_edges to find selfloop edges in the graph
selfloops = list(nx.selfloop_edges(G, data=True))
print('Selfloop edges:', selfloops)
<|EOT|>
