<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(0,1), (0,2), (1,2), (1,3), (2,3), (3,4)], can you use the CohesiveBlocks.crossing function to obtain a boolean vector indicating which edges lie between clusters?
### Response:
from igraph import Graph, CohesiveBlocks

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

# Compute the cohesive block structure of a graph
cb = CohesiveBlocks(g)
cb = cb.calculate()

# Get a boolean vector where element i is True
# if edge i lies between clusters, False otherwise
crossing_edges = cb.crossing()

# Print the list of edges being crossed
print(crossing_edges)
<|EOT|>
