Easy c++ solution || DFS
\nclass Solution {\npublic:\n    void dfs(int i, int &count, vector<bool> &visited, vector<vector<int>> &adj){\n        visited[i] = true;\n        count++;\n  
```\nclass Solution {\npublic:\n    void dfs(int i, int &count, vector<bool> &visited, vector<vector<int>> &adj){\n        visited[i] = true;\n        count++;\n        for(auto it : adj[i])\n        {\n            if(!visited[it])\n            dfs(it, count, visited, adj);\n        }\n    }\n    int maximumDetonation(vector<vector<int>>& bombs) {\n       int n = bombs.size();\n       vector<vector<int>> adj(n);\n       for(int i=0; i<n; i++){\n           long long r1 = bombs[i][2];\n           long long x1 = bombs[i][0], y1 = bombs[i][1];\n           for(int j = 0; j<n; j++){\n             if(j != i){\n                 long long x2 = bombs[j][0], y2 = bombs[j][1];\n                 long long dist = (x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2);\n                 if(dist <= r1*r1)\n                 adj[i].push_back(j);\n             }\n           }\n       }\n       vector<bool> visited(n, 0);\n       int ans = 0;\n       for(int i=0; i<n; i++)\n       {\n           int count = 0;\n           dfs(i, count, visited, adj);\n           ans = max(ans, count);\n           fill(visited.begin(), visited.end(), 0);\n       } \n       return ans;\n    }\n};\n```
['Depth-First Search', 'Graph', 'C']