<｜begin▁of▁sentence｜>### Instruction:
Given 10 vertices, with two types of vertices distributed equally, and connection probabilities of 0.3 for the same type and 0.1 for different types, can you generate a directed graph based on asymmetric vertex types and connection probabilities without loop edges?
### Response:
from igraph import GraphBase

# Parameters
n = 10
# Joint distribution of vertex types: [0.5, 0.5], two types with equal probability
type_dist_matrix = [[0.5, 0.5], [0.5, 0.5]]
# Connection probabilities for different vertex types: [0.3, 0.1] and [0.1, 0.3]
pref_matrix = [[0.3, 0.1], [0.1, 0.3]]
loops = False

# Create the graph with asymmetric preference
graph = GraphBase.Asymmetric_Preference(n, type_dist_matrix, pref_matrix, loops=loops)

# Print the generated edges
print(graph.get_edgelist())
<|EOT|>
