<｜begin▁of▁sentence｜>### Instruction:
Imagine you're creating a little game for the children to help them understand the concept of friendships within a group. You have a playgroup of kids, where some are friends with others, and you want to show all the possible friendship trios that can happen. The current friendships in your playgroup are like these connections: one child (child 1) is friends with another (child 2), who is friends with a third (child 3), and this third child is friends with the first one (child 1) again. There are also friendships between child 3 and a fourth child (child 4), as well as between child 4 and both child 1 and child 2.

Your task in our game is to find all the different sets of three children where each one is friends with the other two, forming a trio or a circle of friends. How would you create little friendship circles using these connections? Remember, you're just arranging the playgroup into all the possible friendship trios without leaving anyone out, so each trio should have three kids who are all connected by their friendships.
### Response:
import networkx as nx

# Create a directed graph
G = nx.DiGraph()
# Add edges to the graph
G.add_edges_from([(1, 2), (2, 3), (3, 1), (3, 4), (4, 1), (4, 2)])

# Generate all triads
for triad in nx.all_triads(G):
    print(triad.edges())
<|EOT|>
