<｜begin▁of▁sentence｜>### Instruction:
Given a bipartite graph represented by an edge set [(0, 1), (0, 2), (1, 3), (2, 3)] and the types of vertices (0 for one set, 1 for the other set), can you use the maximum_bipartite_matching function to find the maximum matching in the graph?
### Response:
from igraph import Graph

# Define bipartite graph with edge list and type list
edges = [(0, 1), (0, 2), (1, 3), (2, 3)]
types = [0, 0, 1, 1]  # 0s are one set, 1s are the other set
g = Graph(edges)

# Run maximum_bipartite_matching
matching = g.maximum_bipartite_matching(types=types)
print(f'Matching: {matching}')
print(f'Matched edges: {matching.edges()}')
<|EOT|>
