Python Solution that you want :
\nclass Solution:\n    def maximumDetonation(self, bombs: List[List[int]]) -> int:\n        if len(bombs)==1:\n            return 1\n        \n        adlist={i
```\nclass Solution:\n    def maximumDetonation(self, bombs: List[List[int]]) -> int:\n        if len(bombs)==1:\n            return 1\n        \n        adlist={i:[] for i in range(len(bombs))}\n        \n        for i in range(len(bombs)):\n            x1,y1,r1=bombs[i]\n            for j in range(i+1,len(bombs)):\n                x2,y2,r2=bombs[j]\n                dist=((x2-x1)**2+(y2-y1)**2)**(1/2)\n                if dist<=r1:\n                    adlist[i].append(j)  \n                if dist<=r2:\n                    adlist[j].append(i)\n        \n        def dfs(adlist,seen,start):\n            seen.add(start)\n            for i in adlist[start]:\n                if i not in seen:\n                    dfs(adlist,seen,i)\n        maxx=1   \n        for v in adlist:\n            seen=set()\n            seen.add(v)\n            dfs(adlist,seen,v)\n            maxx=max(maxx,len(seen))\n        return maxx\n```
['Depth-First Search', 'Python', 'Python3']