<｜begin▁of▁sentence｜>### Instruction:
As a guidance counselor for a high school's math and science club, I often help students with their research and projects. Today, a group of students approached me with a network graph project. They have created a simple graph with 5 vertices and a list of edges, and they want to ensure that the EdgeSeq of the graph contains all the edges exactly once and in the order of their edge IDs. They are using the Python library NetworkX to work with the graph data structure, and they are seeking guidance on how to validate the order and presence of edges using NetworkX.
### Response:
import igraph as ig

# Create a simple example graph
g = ig.Graph(n=5, edges=[(0, 1), (1, 2), (2, 3), (3, 4)])

# Get the EdgeSeq of the graph
edges = g.es

# Check if the EdgeSeq contains all the edges
contains_all_edges = edges.is_all()

# Print the result
print('Does the edge sequence contain all edges exactly once?:', contains_all_edges)
<|EOT|>
