<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edge set [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)], can you use a community detection algorithm in igraph and print the string representation of the resulting VertexClustering?
### Response:
import igraph as ig

# Create a simple graph
edges = [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)]
g = ig.Graph(edges=edges, directed=False)

# Detect communities using a simple community detection algorithm
communities = g.community_edge_betweenness()
clustering = communities.as_clustering()

# Print the string representation of the VertexClustering
print(str(clustering))
<|EOT|>
