<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (0, 2), (2, 3), (3, 4), (4, 5)], how can you obtain the sizes of clusters generated by a community detection algorithm using igraph?
### Response:
from igraph import Graph

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

# Run a community detection algorithm to get a VertexClustering object
vc = g.community_edge_betweenness()
clusters = vc.as_clustering()

# Get the sizes of the clusters
sizes = clusters.sizes()
print(sizes)
<|EOT|>
