<｜begin▁of▁sentence｜>### Instruction:
Imagine our classroom has created a beautiful friendship map, where each arrow represents a time a friend shared a toy with another friend. Sometimes, our kind-hearted children share toys more than once with the same friend, and we've drawn an extra arrow for every additional time they've shared. We drew this map on paper before, but now we've decided to make it digital using a big-kid tool called NetworkX, so we can keep adding to it as we make more friends and share even more!

Class, today, we'll look at our friendship map, which is a special kind of picture called a "directed graph" because it shows who gives and who receives. We want to figure out all the instances when a friend shared multiple times with the same friend. Our digital map is like our classroom: full of fun and repeated kindness!

So, here's our fun task: Let’s find out every time one of our dear friends in the classroom shared toys with another friend more than once and list all those extra special sharing moments. This way, we can say a big "thank you" to those generous children for sharing so many times! Can you help me list all those repeated kind moments from our digital friendship map created with NetworkX?
### Response:
import networkx as nx

# Create a directed graph with possible multiple edges
G = nx.MultiDiGraph()
# Add multiple edges between two nodes
G.add_edge('A', 'B')
G.add_edge('A', 'B')
G.add_edge('B', 'A')
# Use show_multidiedges to get a list of multiple edges
multidiedges = nx.show_multidiedges(G)
print('Multi directed edges:', multidiedges)
<|EOT|>
