<｜begin▁of▁sentence｜>### Instruction:
Given a directed graph with edges [(0, 1), (0, 2), (1, 3)], can you calculate the personalized PageRank values using a damping factor of 0.85 and a personalization vector of [0.5, 0.3, 0.1, 0.1] for all the vertices?
### Response:
from igraph import Graph

g = Graph(edges=[(0, 1), (0, 2), (1, 3)], directed=True)

damping_factor = 0.85
reset_vector = [0.5, 0.3, 0.1, 0.1]  # Personalization vector
vertices_to_calculate = [0, 1, 2, 3]  # All the vertices
pagerank_values = g.personalized_pagerank(vertices=vertices_to_calculate, directed=True, damping=damping_factor, reset=reset_vector)

print(pagerank_values)
<|EOT|>
