<｜begin▁of▁sentence｜>### Instruction:
As a criminal investigator, you are assigned to investigate a series of events involving a criminal network. You have access to the networkx Python library, which allows you to simulate and analyze connections within a directed graph representing the criminal activities.

You are given a directed graph with edges [(0, 1), (1, 2), (2, 0)], which represents the sequence of events or actions taken by the criminals. Your task is to determine whether the sequence of edges contains all the edges exactly once, in the order of their IDs. You need to use the networkx library to analyze the graph and print the boolean result, indicating whether the sequence of events follows a unique and ordered pattern representative of the criminal network's activities.
### Response:
from igraph import Graph

# Creating a graph with some edges
g = Graph([(0, 1), (1, 2), (2, 0)])
# Get the sequence of edges
e_seq = g.es
# Check if the edge sequence contains all edges exactly once
is_all_edges = e_seq.is_all()

print(f'Edge sequence contains all edges exactly once: {is_all_edges}')
<|EOT|>
