Yeah, just pull out a graph library, map every contact to a node, edges to interactions, then compute betweenness centrality to find the real gatekeepers, prune the low‑weight spokes, and keep the high‑value hubs. Once you’ve got that matrix, you can run a shortest‑path analysis to see who can get you anywhere fastest. What data are you looking at?