C++ || EASY TO UNDERSTAND || using basic DFS
\n\nclass Solution {\n#define ll long long int\n    public:\n    void dfs(vector<vector<int>> &graph,vector<bool> &visited,int &c,int &i)\n    {\n        visite
```\n\nclass Solution {\n#define ll long long int\n    public:\n    void dfs(vector<vector<int>> &graph,vector<bool> &visited,int &c,int &i)\n    {\n        visited[i]=true;\n        c++;\n        for(int j=0;j<graph[i].size();j++)\n        {\n            if(!visited[graph[i][j]])\n             dfs(graph,visited,c,graph[i][j]);   \n        }\n    }\n    int maximumDetonation(vector<vector<int>>& bombs) {\n\n        int n=bombs.size();\n        vector<vector<int> > graph(n);\n        for(int i=0;i<n;i++)\n        {\n            ll x1,y1,r1;\n            x1=bombs[i][0];\n            y1=bombs[i][1];\n            r1=bombs[i][2];\n            for(int j=0;j<n;j++)\n            {\n                if(i!=j)\n                {\n                     ll x2,y2,r2;\n                     x2=abs(x1-bombs[j][0]);\n                     y2=abs(y1-bombs[j][1]);\n                    if(x2*x2+y2*y2<=r1*r1)\n                    {\n                        graph[i].push_back(j);\n                    }\n                }\n            }\n        }\n        int ans=INT_MIN;\n        for(int i=0;i<n;i++)\n        {\n            int c=0;\n            vector<bool> visited(n,false);\n            dfs(graph,visited,c,i);\n            ans=max(ans,c);\n        }\n        return ans;\n    }\n};\n```\n**Please upvote to motivate me in my quest of documenting all leetcode solutions(to help the community). HAPPY CODING:)\nAny suggestions and improvements are always welcome**
['Depth-First Search', 'Graph']