<｜begin▁of▁sentence｜>### Instruction:
As a conservation biologist, you are working on a project to study and protect the biodiversity and ecosystems in a national park. You have collected data on the interactions between different species and their habitats, and you have represented this data as a bipartite graph. Now, you want to use the is_matched method in the networkx library to determine which pairs of species and habitats are matched as part of a maximum matching, which will help you understand the most efficient resource allocation for conservation efforts.
### Response:
from igraph import Graph, Matching

# Create a graph with an even number of vertices
edges = [(0, 1), (1, 2), (2, 3), (3, 0)]
g = Graph(edges)

# Calculate a maximum matching
matching = g.maximum_bipartite_matching()

# Check if a vertex is matched
data = [{vertex: matching.is_matched(vertex)} for vertex in range(g.vcount())]
print(data)
<|EOT|>
