<｜begin▁of▁sentence｜>### Instruction:
As a helpful assistant with expertise in networkx, let's rephrase the question based on your profession.

You are a police officer responsible for maintaining order and ensuring that all laws are enforced effectively. Imagine that you have received a series of calls reporting suspicious activity in different areas of the city. Each set of calls represents a connection between the locations. Now, you need to determine if the sequence of reported connections contains all the reported locations exactly once and in the order of their appearance in the calls. Use the EdgeSeq.is_all method to analyze and verify this sequence of reported connections.
### Response:
from igraph import Graph

# Create a graph
edges = [(0, 1), (1, 2), (2, 3), (3, 0)]
g = Graph(edges=edges)

# Get the EdgeSeq object for all edges in the graph
edge_seq = g.es

# Check if the EdgeSeq object contains all edges exactly once
is_all_edges = edge_seq.is_all()

# Print the result
print('Contains all edges:', is_all_edges)
<|EOT|>
