<｜begin▁of▁sentence｜>### Instruction:
Given a graph with 5 nodes and 7 edges forming a small network, can you calculate the global transitivity (clustering coefficient) of the graph, which is a measure of the overall likelihood that two connected vertices are both connected to a third vertex?
### Response:
from igraph import Graph

# Generate a graph with 5 vertices and 7 edges
g = Graph([(0, 1), (0, 2), (1, 2), (1, 3), (1, 4), (2, 3), (3, 4)])

# Calculate the global transitivity of the graph
global_transitivity = g.transitivity_undirected(mode='zero')
print('Global Transitivity:', global_transitivity)
<|EOT|>
