<｜begin▁of▁sentence｜>### Instruction:
As a Quality Assurance Tester, you are required to evaluate and ensure the quality standards and functional requirements of a software application. In this case, you are asked to apply network analysis to a directed graph to calculate and print Kleinberg's hub scores for each vertex in the graph using the Graph.hub_score function from the NetworkX library. This analysis will provide valuable insights into the importance of specific nodes within the network, allowing for further optimization and enhancement of the software application's performance.
### Response:
from igraph import Graph

# Create a directed graph
edges = [(0, 1), (0, 2), (2, 3), (3, 4), (4, 0), (1, 5), (5, 0)]
g = Graph(edges=edges, directed=True)

# Calculate hub scores
hub_scores = g.hub_score()

# Print hub scores
print('Hub scores:', hub_scores)
<|EOT|>
