From 6bbc8eae846190bc0734a6c03122eceb4e5a9d58 Mon Sep 17 00:00:00 2001
From: luxiaotao1123 <t1341870251@163.com>
Date: 星期三, 27 十一月 2024 16:53:55 +0800
Subject: [PATCH] #
---
zy-acs-manager/src/main/java/com/zy/acs/manager/core/service/MapService.java | 118 ++++++++++++++++++++++++++++++++++++++++++++++++++--------
1 files changed, 101 insertions(+), 17 deletions(-)
diff --git a/zy-acs-manager/src/main/java/com/zy/acs/manager/core/service/MapService.java b/zy-acs-manager/src/main/java/com/zy/acs/manager/core/service/MapService.java
index 2097a81..c7c9dd0 100644
--- a/zy-acs-manager/src/main/java/com/zy/acs/manager/core/service/MapService.java
+++ b/zy-acs-manager/src/main/java/com/zy/acs/manager/core/service/MapService.java
@@ -19,9 +19,7 @@
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Component;
-import java.util.ArrayList;
-import java.util.Collections;
-import java.util.List;
+import java.util.*;
import java.util.stream.Collectors;
/**
@@ -246,8 +244,10 @@
return nodeList.stream().map(NavigateNode::getCodeData).distinct().collect(Collectors.toList());
}
+ // v1 BFS ------------------------------------------------------------------------------
public List<NavigateNode> getWaveScopeByCode(Integer lev, String code, Double radiusLen) {
String[][] codeMatrix = mapDataDispatcher.getCodeMatrix(lev);
+ String[][] cdaMatrix = mapDataDispatcher.getCdaMatrix(lev);
int[] codeMatrixIdx = mapDataDispatcher.getCodeMatrixIdx(lev, code);
NavigateNode originNode = new NavigateNode(codeMatrixIdx[0], codeMatrixIdx[1], code);
@@ -258,25 +258,25 @@
includeList.add(originNode);
existNodes.add(originNode);
- this.spreadWaveNode(originNode, originNode, codeMatrix, radiusLen, includeList, existNodes);
+ this.spreadWaveNode(originNode, originNode, codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
return includeList;
}
public void spreadWaveNode(NavigateNode originNode, NavigateNode currNode
- , String[][] codeMatrix, Double radiusLen
+ , String[][] codeMatrix, String[][] cdaMatrix, Double radiusLen
, List<NavigateNode> includeList, List<NavigateNode> existNodes) {
int x = currNode.getX();
int y = currNode.getY();
- this.extendNeighborNodes(originNode, new NavigateNode(x, y + 1), codeMatrix, radiusLen, includeList, existNodes);
- this.extendNeighborNodes(originNode, new NavigateNode(x, y - 1), codeMatrix, radiusLen, includeList, existNodes);
- this.extendNeighborNodes(originNode, new NavigateNode(x - 1, y), codeMatrix, radiusLen, includeList, existNodes);
- this.extendNeighborNodes(originNode, new NavigateNode(x + 1, y), codeMatrix, radiusLen, includeList, existNodes);
+ this.extendNeighborNodes(originNode, new NavigateNode(x, y + 1), codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
+ this.extendNeighborNodes(originNode, new NavigateNode(x, y - 1), codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
+ this.extendNeighborNodes(originNode, new NavigateNode(x - 1, y), codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
+ this.extendNeighborNodes(originNode, new NavigateNode(x + 1, y), codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
}
public void extendNeighborNodes(NavigateNode originNode, NavigateNode nextNode
- , String[][] codeMatrix, Double radiusLen
+ , String[][] codeMatrix, String[][] cdaMatrix, Double radiusLen
, List<NavigateNode> includeList, List<NavigateNode> existNodes) {
int x = nextNode.getX();
@@ -297,15 +297,10 @@
if (nextNodeCodeData.equals(CodeNodeType.NONE.val)) {
- this.spreadWaveNode(originNode, nextNode, codeMatrix, radiusLen, includeList, existNodes);
+ this.spreadWaveNode(originNode, nextNode, codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
} else {
- Integer lev = MapDataDispatcher.MAP_DEFAULT_LEV;
- String[][] cdaMatrix = mapDataDispatcher.getCdaMatrix(lev);
-
-// Code o1 = codeService.selectByData(originNode.getCodeData());
-// Code o2 = codeService.selectByData(nextNodeCodeData);
List<Double> o1Cda = MapDataUtils.parseCdaNode(cdaMatrix[originNode.getX()][originNode.getY()]);
List<Double> o2Cda = MapDataUtils.parseCdaNode(cdaMatrix[nextNode.getX()][nextNode.getY()]);
@@ -314,7 +309,7 @@
nextNode.setCodeData(nextNodeCodeData);
includeList.add(nextNode);
- this.spreadWaveNode(originNode, nextNode, codeMatrix, radiusLen, includeList, existNodes);
+ this.spreadWaveNode(originNode, nextNode, codeMatrix, cdaMatrix, radiusLen, includeList, existNodes);
}
}
@@ -336,6 +331,95 @@
return o1.getX() == o2.getX() && o1.getY() == o2.getY();
}
+ // v2 BFS ------------------------------------------------------------------------------
+ public List<NavigateNode> getWaveScopeByCode0(Integer lev, String code, Double radiusLen) {
+ String[][] codeMatrix = mapDataDispatcher.getCodeMatrix(lev);
+
+ int[] codeMatrixIdx = mapDataDispatcher.getCodeMatrixIdx(lev, code);
+ NavigateNode originNode = new NavigateNode(codeMatrixIdx[0], codeMatrixIdx[1], code);
+
+ List<NavigateNode> includeList = new ArrayList<>();
+ Set<NavigateNode> visited = new HashSet<>(); // Track visited nodes to avoid re-processing
+ Queue<NavigateNode> queue = new LinkedList<>();
+
+ includeList.add(originNode);
+ visited.add(originNode);
+ queue.offer(originNode);
+
+ while (!queue.isEmpty()) {
+ NavigateNode currNode = queue.poll();
+ this.spreadWaveNode0(originNode, currNode, codeMatrix, radiusLen, includeList, visited, queue);
+ }
+
+ return includeList;
+ }
+
+ public void spreadWaveNode0(NavigateNode originNode, NavigateNode currNode,
+ String[][] codeMatrix, Double radiusLen,
+ List<NavigateNode> includeList, Set<NavigateNode> visited, Queue<NavigateNode> queue) {
+
+ int x = currNode.getX();
+ int y = currNode.getY();
+
+ // Expand neighbors in all four directions (up, down, left, right)
+ this.extendNeighborNodes0(originNode, new NavigateNode(x, y + 1), codeMatrix, radiusLen, includeList, visited, queue);
+ this.extendNeighborNodes0(originNode, new NavigateNode(x, y - 1), codeMatrix, radiusLen, includeList, visited, queue);
+ this.extendNeighborNodes0(originNode, new NavigateNode(x - 1, y), codeMatrix, radiusLen, includeList, visited, queue);
+ this.extendNeighborNodes0(originNode, new NavigateNode(x + 1, y), codeMatrix, radiusLen, includeList, visited, queue);
+ }
+
+ public void extendNeighborNodes0(NavigateNode originNode, NavigateNode nextNode,
+ String[][] codeMatrix, Double radiusLen,
+ List<NavigateNode> includeList, Set<NavigateNode> visited, Queue<NavigateNode> queue) {
+ int x = nextNode.getX();
+ int y = nextNode.getY();
+
+ // Check if the node is out of bounds
+ if (x < 0 || x >= codeMatrix.length || y < 0 || y >= codeMatrix[0].length) {
+ return;
+ }
+
+ // If the node has already been visited, skip it
+ if (this.isExist0(nextNode, visited)) {
+ return;
+ }
+
+ visited.add(nextNode);
+
+ String nextNodeCodeData = codeMatrix[x][y];
+
+ // If it's a NONE node, we still need to check its surroundings
+ if (nextNodeCodeData.equals(CodeNodeType.NONE.val)) {
+ this.spreadWaveNode0(originNode, nextNode, codeMatrix, radiusLen, includeList, visited, queue);
+ } else {
+ Integer lev = MapDataDispatcher.MAP_DEFAULT_LEV;
+ String[][] cdaMatrix = mapDataDispatcher.getCdaMatrix(lev);
+
+ // Check if the distance between nodes is within the radius length
+ List<Double> o1Cda = MapDataUtils.parseCdaNode(cdaMatrix[originNode.getX()][originNode.getY()]);
+ List<Double> o2Cda = MapDataUtils.parseCdaNode(cdaMatrix[nextNode.getX()][nextNode.getY()]);
+
+ // Calculate Euclidean distance between the nodes
+ if (Math.pow(o1Cda.get(0) - o2Cda.get(0), 2) + Math.pow(o1Cda.get(1) - o2Cda.get(1), 2) <= Math.pow(radiusLen, 2)) {
+ nextNode.setCodeData(nextNodeCodeData);
+ includeList.add(nextNode);
+
+ // Add the node to the queue to expand its neighbors
+ queue.offer(nextNode);
+ }
+ }
+ }
+
+ private boolean isExist0(NavigateNode node, Set<NavigateNode> existNodes) {
+ for (NavigateNode existNode : existNodes) {
+ if (this.isSame(node, existNode)) {
+ return true;
+ }
+ }
+ return false;
+ }
+
+
public Boolean isTurnCorner(String codeData) {
if (Cools.isEmpty(codeData)) {
return false;
--
Gitblit v1.9.1