Leetcode 2372. Calculate the Influence of Each Salesperson

Given a directed graph where an edge A→B means A influences B, compute for each salesperson how many others they can influence directly or transitively. The challenge is efficiently computing reachability/influence for all nodes in the presence of cycles and large networks (requiring graph compression or other scalable reachability techniques).