<｜begin▁of▁sentence｜>### Instruction:
As a public defender representing clients who cannot afford legal counsel in criminal proceedings, you have been tasked with analyzing the flow of information within a network of individuals involved in a case. You have a directed graph with vertices representing key individuals, such as witnesses, suspects, and informants, and edges indicating the flow of information between them. The graph is composed of vertices {0, 1, 2, 3, 4} and edges {(0, 1), (0, 2), (1, 2), (2, 3), (3, 4)}. In order to understand the level of convergence for each individual in the network, you want to use igraph's Graph.convergence_degree function to calculate the convergence degree of each vertex, which will help you identify the key players in the information flow within the network.
### Response:
import igraph as ig

# Let's create a directed graph with some edges
g = ig.Graph(directed=True)
g.add_vertices(5)
g.add_edges([(0, 1), (0, 2), (1, 2), (2, 3), (3, 4)])

# Use the convergence_degree method to get the convergence of each vertex
g_convergence = g.convergence_degree()

# Print the convergence degree of each vertex
for vertex in range(g.vcount()):
    print(f'Vertex {vertex}: Convergence Degree = {g_convergence[vertex]}')
<|EOT|>
