Social Network Graph Analyzer
- Developed a C++ graph analytics engine for social network modeling, combining BFS/DFS traversal, Dijkstra’s algorithm, and DSU (union-by-rank with path compression) to power friend suggestions, shortest-path queries, and community detection across 10+ supported operations; benchmarked on the SNAP Facebook ego-network dataset (4K+ nodes, 88K+ edges) with average query latency.
- Applied PageRank to rank influential users and built a probabilistic simulator to model how misinformation spreads through the network, identifying key bridge users whose removal would disconnect parts of the network.