<｜begin▁of▁sentence｜>### Instruction:
Given a bipartite graph with nodes separated as [1, 1, 0, 0] and edges defined as [(0, 1), (0, 2), (1, 3), (2, 3)], can you use the is_matched function from the Matching class in igraph to check if a vertex with ID 1 is matched after calculating the maximum bipartite matching?
### Response:
from igraph import Graph
from igraph import Matching

# Assume we have a Bipartite Graph
edges = [(0, 1), (0, 2), (1, 3), (2, 3)]
g = Graph.Bipartite([1, 1, 0, 0], edges)

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

# Check if a vertex is matched
vertex_id = 1
is_vertex_matched = matching.is_matched(vertex_id)

print(f'Is vertex {vertex_id} matched?: {is_vertex_matched}')
<|EOT|>
