<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges set to [(0, 1), (0, 2), (1, 2), (1, 3), (3, 4), (4, 5)], can you perform a maximum cardinality search and print out the ranks for each vertex?
### Response:
import igraph as ig

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

# Perform maximum cardinality search
alpha, alpha_inv = g.maximum_cardinality_search()

# Print vertex ranks based on maximum cardinality search
print('Vertex ranks:', alpha)
<|EOT|>
