<｜begin▁of▁sentence｜>### Instruction:
As a forensic psychologist, when creating a visual representation of a directed graph for a criminal investigation or legal case, it's important to determine the number of vertices required for a full graph without any self-loops. Consider a scenario where there are 5 different individuals involved in a complex criminal network. How would you visually represent the connections and relationships between these individuals in a graph, ensuring that each person is accurately represented as a vertex and the connections are clearly depicted?
### Response:
import igraph as ig

# Generate a full directed graph without loops with 5 vertices
full_graph = ig.Graph.Full(5, directed=True, loops=False)

# Print the adjacency matrix of the full graph
print(full_graph.get_adjacency())

# Show the graph
ig.plot(full_graph)
<|EOT|>
