Leetcode 2101. Detonate the Maximum Bombs

Given bombs as circles (xi, yi, ri), form a directed graph where there is an edge i→j if bomb j's center lies within bomb i's radius (chain detonations follow edges). The task is to compute the maximum number of bombs reachable from any single start node (i.e., max reachability in this geometric directed graph), with n ≤ 100 allowing O(n^2) edge construction.