<｜begin▁of▁sentence｜>### Instruction:
Given a group of 10 military officers, half of them are army officers and the other half are navy officers. The army officers have a 30% chance of forming connections with other army officers, while the navy officers have a 30% chance of forming connections with other navy officers. However, the probability of an army officer forming a connection with a navy officer is 10%. Create a directed graph that represents the connections between these military officers, ensuring that there are no loops in the graph.
### 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|>
