<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [(0, 1), (1, 2), (2, 0), (1, 3), (3, 4), (4, 5), (5, 3)], can you calculate the local transitivity (clustering coefficient) for each vertex?
### Response:
from igraph import Graph

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

# Calculate local transitivity for each vertex
transitivities = graph.transitivity_local_undirected()

# Print the local transitivity for each vertex
for v_index, transitivity in enumerate(transitivities):
    print(f"Vertex {v_index}: Transitivity = {transitivity}")
<|EOT|>
