DFS || Cinch Solution
Intuition   \n- Determine if a bomb is placed within the destroyable range of other bombs  \n- Recall equation of a circle- \n X^2 + Y^2 = R^2\n-  Equation for 
# Intuition   \n- Determine if a bomb is placed within the destroyable range of other bombs  \n- **Recall equation of a circle- \n X^2 + Y^2 = R^2**\n-  Equation for bomb Within the Range\n**(X-x)^2 + (Y-y)^2 <= R^2** \n- If there is a bomb within range, establish a connection.\n- Detonate each bomb and identify the one capable of detonating the maximum number of bombs.\n\n# Code\n```\nclass Solution {\npublic:\n\n    int dfs(int node, vector<int> adj[], vector<bool>& vis){\n        vis[node] = 1;\n        int count=1;\n        for(auto it : adj[node])\n            if(!vis[it])\n                count += dfs(it, adj, vis);\n        return count;\n    }\n\n    int maximumDetonation(vector<vector<int>>& nums) {\n        int n = nums.size();\n        vector<int> adj[n];\n\n        for(int i=0; i<n; i++){\n            for(int j=0; j<n; j++){\n                if(i == j)\n                    continue;\n                int x = abs(nums[i][0] - nums[j][0]);\n                int y = abs(nums[i][1] - nums[j][1]);\n                if( pow(x,2) + pow(y,2) <= pow(nums[i][2],2) )\n                    adj[i].push_back(j);\n            }\n        }\n        int ans=0;\n        for(int i=0; i<n; i++){\n            vector<bool> vis(n, 0);\n            ans = max(ans, dfs(i, adj, vis));\n        }\n        return ans;\n    }\n};\n\n```
['Depth-First Search', 'C++']