C++ || DFS || EASY TO UNDERSTAND
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    void dfs(vector<int>&vis,vector<vector<int>>&temp,int &t,int& i){\n        vis[i]=1;\n          t++;\n        for(int j=0;j<temp[i].size();j++){\n            if(!vis[temp[i][j]]){\n                \n                dfs(vis,temp,t,temp[i][j]);\n            }\n        }\n    }\n\n    int maximumDetonation(vector<vector<int>>& bombs) {\n        int n=bombs.size();\n        vector<vector<int>>temp(n);\n\n        for(int i=0;i<n;i++){\n            long long x=bombs[i][0];\n            long long y=bombs[i][1];\n            long long r=bombs[i][2];\n            for(int j=0;j<n;j++){\n                if(i!=j){\n                    long long x1=abs(x-bombs[j][0]);\n                    long long y1=abs(y-bombs[j][1]);\n                    if(x1*x1+y1*y1<=r*r){\n                        temp[i].push_back(j);\n                    }\n                }\n            }\n        }\n\n       \n        int ans=INT_MIN;\n        for(int i=0;i<n;i++){\n            int t=0;\n       vector<int>vis(n,0);\n                dfs(vis,temp,t,i);\n                ans=max(ans,t);\n            \n        }\n        return ans;\n    }\n};\n```
['Depth-First Search', 'Graph', 'C++']