<｜begin▁of▁sentence｜>### Instruction:
Given 10 vertices with two types (first 5 vertices of one type and last 5 of another), can you generate a graph based on asymmetric connection probabilities between vertex types, where the connection probability from the first type to the second type is 0.8, from the second type to the first type is 0.2, within the first type is 0.1, and within the second type is 0.05?
### Response:
from igraph import Graph

# Define the number of vertices and types
num_vertices = 10
types = [False] * 5 + [True] * 5 # First 5 are of one type, last 5 of another type

# Define connection probabilities between vertex types
prob_matrix = [[0.1, 0.8], [0.2, 0.05]]

# Generate an asymmetric preference graph
graph = Graph.Asymmetric_Preference(num_vertices, types, prob_matrix)

# Print summary of the generated graph
print(graph.summary())
<|EOT|>
