| | |
| | | |
| | | Set<String> visited = new HashSet<>(); |
| | | |
| | | // 遍历所有节点,寻找度数不等于2的节点作为起点 |
| | | for (String codeData : codeDataList) { |
| | | if (adjacencyCodeMap.get(codeData).size() != 2) { |
| | | if (!visited.contains(codeData)) { |
| | | Lane lane = new Lane(String.valueOf(snowflakeIdWorker.nextId()).substring(3)); |
| | | dfsCalc(codeData, null, lane, visited, adjacencyCodeMap); |
| | | lanes.add(lane); |
| | | if (adjacencyCodeMap.getOrDefault(codeData, Collections.emptyList()).size() != 2) { |
| | | List<String> neighbors = adjacencyCodeMap.getOrDefault(codeData, Collections.emptyList()); |
| | | for (String neighbor : neighbors) { |
| | | // 仅遍历度数为2且未被访问的邻居 |
| | | if (adjacencyCodeMap.getOrDefault(neighbor, Collections.emptyList()).size() == 2 && !visited.contains(neighbor)) { |
| | | Lane lane = new Lane(String.valueOf(snowflakeIdWorker.nextId()).substring(3)); |
| | | dfsCalc(neighbor, codeData, lane, visited, adjacencyCodeMap); |
| | | lanes.add(lane); |
| | | } |
| | | } |
| | | } |
| | | } |
| | | |
| | | // 处理度数为2且连接两个拐弯点的节点(独立巷道) |
| | | for (String codeData : codeDataList) { |
| | | if (adjacencyCodeMap.getOrDefault(codeData, Collections.emptyList()).size() == 2 && !visited.contains(codeData)) { |
| | | List<String> neighbors = adjacencyCodeMap.getOrDefault(codeData, Collections.emptyList()); |
| | | boolean connectedToTwoTurningPoints = true; |
| | | for (String neighbor : neighbors) { |
| | | if (adjacencyCodeMap.getOrDefault(neighbor, Collections.emptyList()).size() == 2) { |
| | | connectedToTwoTurningPoints = false; |
| | | break; |
| | | } |
| | | } |
| | | if (connectedToTwoTurningPoints) { |
| | | Lane lane = new Lane(String.valueOf(snowflakeIdWorker.nextId()).substring(3)); |
| | | lane.getCodes().add(codeData); |
| | | lanes.add(lane); |
| | | visited.add(codeData); |
| | | } |
| | | } |
| | | } |
| | | |
| | | |
| | | System.out.println(GsonUtils.toJson(lanes)); |
| | | return R.ok().add(lanes); |
| | | } |
| | | |
| | | |
| | | private void dfsCalc(String code, String parent, Lane lane, Set<String> visited, Map<String, List<String>> adjacencyCodeMap) { |
| | | // 检查当前节点的度数是否为2 |
| | | if (adjacencyCodeMap.getOrDefault(code, Collections.emptyList()).size() != 2) { |
| | | // 不包含拐弯点 |
| | | return; |
| | | } |
| | | |
| | | // 标记为已访问并加入巷道 |
| | | visited.add(code); |
| | | lane.getCodes().add(code); |
| | | |
| | |
| | | } |
| | | |
| | | for (String neighbor : neighbors) { |
| | | if (parent != null && neighbor.equals(parent)) { |
| | | if (neighbor.equals(parent)) { |
| | | continue; |
| | | } |
| | | if (!visited.contains(neighbor) && isSameDirection(code, neighbor, parent)) { |
| | | dfsCalc(neighbor, code, lane, visited, adjacencyCodeMap); |
| | | |
| | | if (adjacencyCodeMap.getOrDefault(neighbor, Collections.emptyList()).size() == 2 && !visited.contains(neighbor)) { |
| | | // 检查方向是否一致 |
| | | if (isSameDirection(code, neighbor, parent)) { |
| | | dfsCalc(neighbor, code, lane, visited, adjacencyCodeMap); |
| | | } |
| | | } |
| | | } |
| | | } |
| | |
| | | if (parent == null) { |
| | | return true; |
| | | } |
| | | |
| | | Code parentCode = codeService.selectByData(parent); |
| | | Code currentCode = codeService.selectByData(code); |
| | | Code neighborCode = codeService.selectByData(neighbor); |
| | |
| | | double direction2 = calculateDirection(currentCode, neighborCode); |
| | | double angleDifference = Math.abs(direction1 - direction2); |
| | | |
| | | // 规范化角度差 |
| | | angleDifference = Math.min(angleDifference, 2 * Math.PI - angleDifference); |
| | | |
| | | // 设置角度差阈值为3度 |
| | | return angleDifference < Math.toRadians(3); |
| | | } |
| | | |
| | |
| | | return Math.atan2(deltaY, deltaX); |
| | | } |
| | | |
| | | |
| | | } |