<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (1, 2), (2, 0)], perform an edge-based breadth-first search starting from node 0. What is the order in which the edges are explored?
### Response:
import networkx as nx

# Create a Graph
G = nx.DiGraph()
G.add_edges_from([(0, 1), (1, 2), (2, 0)])

# Perform an edge-based breadth-first search
edges = list(nx.edge_bfs(G, source=0))
print(edges)
<|EOT|>
