Java BFS Solution
Code\n\nclass Solution {\n    public int maximumDetonation(int[][] bombs) {\n        Arrays.sort(bombs, (o1, o2) -> o2[2] - o1[2]);\n        int res = 0;\n     
# Code\n```\nclass Solution {\n    public int maximumDetonation(int[][] bombs) {\n        Arrays.sort(bombs, (o1, o2) -> o2[2] - o1[2]);\n        int res = 0;\n        for (int i = 0; i < bombs.length; i++) {\n            int[][] copy = Arrays.copyOf(bombs, bombs.length);\n            int count = 1;\n            Queue<int[]> queue = new LinkedList<>();\n            queue.offer(copy[i]);\n            copy[i] = null;\n            while (!queue.isEmpty()) {\n                int[] arr = queue.poll();\n                int y = arr[1], x = arr[0], r = arr[2];\n                for (int j = 0; j < copy.length; j++) {\n                    int[] b = copy[j];\n                    if (b == null) continue;\n                    int y1 = b[1], x1 = b[0], r1 = b[2];\n                    double dist = Math.sqrt(Math.pow(y - y1, 2) + Math.pow(x - x1, 2));\n                    if (dist <= r) {\n                        count++;\n                        queue.offer(b);\n                        copy[j] = null;\n                    }\n                }\n            }\n            res = Math.max(count, res);\n        }\n        return res;\n    }\n}\n```
['Java']