Add a node (agent) to the graph.
Get all nodes in the graph.
Get all edges in the graph.
Calculate degree centrality for all nodes. Returns normalized centrality (0-1).
Find strongly connected components using Kosaraju's algorithm.
Get edge count between two agents.
Get unique interaction partners for an agent.
Calculate clustering coefficient for a node. Measures how interconnected a node's neighbors are.
Get statistics about the graph.
Clear the graph.
Directed graph implementation for agent interactions.