From beb476733eaff1f3a76ec1be772337655803cccb Mon Sep 17 00:00:00 2001
From: luxiaotao1123 <t1341870251@163.com>
Date: 星期五, 25 十月 2024 10:53:10 +0800
Subject: [PATCH] #

---
 zy-acs-manager/src/main/java/com/zy/acs/manager/core/DispatcherTestController.java |  173 ++++++++++++++++++++++++++++++++++++++++++++-------------
 1 files changed, 133 insertions(+), 40 deletions(-)

diff --git a/zy-acs-manager/src/main/java/com/zy/acs/manager/core/DispatcherTestController.java b/zy-acs-manager/src/main/java/com/zy/acs/manager/core/DispatcherTestController.java
index 708d4fb..928cb40 100644
--- a/zy-acs-manager/src/main/java/com/zy/acs/manager/core/DispatcherTestController.java
+++ b/zy-acs-manager/src/main/java/com/zy/acs/manager/core/DispatcherTestController.java
@@ -38,70 +38,151 @@
         Map<String, List<String>> adjacencyCodeMap = new HashMap<>();
         for (Code code : codeList) {
             List<Long> adjacencyNode = routeService.getAdjacencyNode(code.getId());
-            adjacencyCodeMap.put(code.getData(), adjacencyNode.stream().map(node -> {
-                return codeService.getById(node).getData();
-            }).collect(Collectors.toList()));
+            adjacencyCodeMap.put(code.getData(), adjacencyNode.stream().map(node -> (
+                    codeService.getById(node).getData()
+            )).collect(Collectors.toList()));
         }
         List<String> codeDataList = codeList.stream().map(Code::getData).collect(Collectors.toList());
-        System.out.println(codeDataList.toString());
-        System.out.println(adjacencyCodeMap.toString());
+//        System.out.println(codeDataList.toString());
+//        System.out.println(adjacencyCodeMap.toString());
 
 
         Set<String> visited = new HashSet<>();
 
         // 閬嶅巻鎵�鏈夎妭鐐癸紝瀵绘壘搴︽暟涓嶇瓑浜�2鐨勮妭鐐逛綔涓鸿捣鐐�
         for (String codeData : codeDataList) {
-            if (adjacencyCodeMap.getOrDefault(codeData, Collections.emptyList()).size() != 2) {
-                List<String> neighbors = adjacencyCodeMap.getOrDefault(codeData, Collections.emptyList());
+            if (adjacencyCodeMap.get(codeData).size() != 2) {
+                List<String> neighbors = adjacencyCodeMap.get(codeData);
                 for (String neighbor : neighbors) {
-                    // 浠呴亶鍘嗗害鏁颁负2涓旀湭琚闂殑閭诲眳
-                    if (adjacencyCodeMap.getOrDefault(neighbor, Collections.emptyList()).size() == 2 && !visited.contains(neighbor)) {
+                    if (adjacencyCodeMap.get(neighbor).size() == 2 && !visited.contains(neighbor)) {
                         Lane lane = new Lane(String.valueOf(snowflakeIdWorker.nextId()).substring(3));
-                        dfsCalc(neighbor, codeData, lane, visited, adjacencyCodeMap);
+                        lane.getCodes().add(codeData); // 鍖呭惈璧风偣
+                        dfsCalcIncludingEnd(codeData, neighbor, lane, visited, adjacencyCodeMap);
                         lanes.add(lane);
                     }
                 }
             }
         }
 
-        // 澶勭悊搴︽暟涓�2涓旇繛鎺ヤ袱涓嫄寮偣鐨勮妭鐐癸紙鐙珛宸烽亾锛�
+        // 澶勭悊鐙珛鐨勫害鏁颁负2鐨勭幆璺垨鏈繛鎺ュ埌搴︽暟涓嶇瓑浜�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);
-                }
+            if (adjacencyCodeMap.get(codeData).size() == 2 && !visited.contains(codeData)) {
+                // 妫�鏌ユ槸鍚︿负鐜矾鐨勪竴閮ㄥ垎
+                Lane lane = new Lane(String.valueOf(snowflakeIdWorker.nextId()).substring(3));
+                dfsCalcForLoop(codeData, null, lane, visited, adjacencyCodeMap);
+                lanes.add(lane);
             }
         }
 
+        /**
+         * 1.explore a dead end lane and checkout end point that is not dead point
+         * 2.if this point has two near points and one of those points which not in current lane was also have two near points too
+         * 3.then merge above two lane because they can connect each other
+         */
+        Iterator<Lane> iterator = lanes.iterator();
+        while (iterator.hasNext()) {
+            Lane lane = iterator.next();
+            String[] endPoints = lane.queryEndPoints();
+            if (null == endPoints) {
+                continue;
+            }
+            String startPoint = endPoints[0];
+            String endPoint = endPoints[1];
+
+            boolean isDeadEndLane = false;
+            String deadEndPoint = null;
+            Integer anotherPointNearsCount = null;
+            if (adjacencyCodeMap.get(startPoint).size() == 1) {
+                isDeadEndLane = true;
+                deadEndPoint = startPoint;
+                anotherPointNearsCount = adjacencyCodeMap.get(endPoint).size();
+            }
+            if (adjacencyCodeMap.get(endPoint).size() == 1) {
+                isDeadEndLane = true;
+                deadEndPoint = endPoint;
+                anotherPointNearsCount = adjacencyCodeMap.get(startPoint).size();
+            }
+
+            if (!isDeadEndLane) {
+                continue;
+            }
+
+            if (anotherPointNearsCount == 2) {
+                String anotherPoint = deadEndPoint.equals(startPoint) ? endPoint : startPoint;
+                List<String> anotherPointNears = adjacencyCodeMap.get(anotherPoint);
+                for (String anotherPointNear : anotherPointNears) {
+                    if (!lane.getCodes().contains(anotherPointNear) && adjacencyCodeMap.get(anotherPointNear).size() == 2) {
+
+                        for (Lane lane0 : lanes) {
+                            if (lane0.getCodes().contains(anotherPointNear)) {
+
+                                lane0.getCodes().addAll(lane.getCodes());
+                                iterator.remove();
+
+
+                                Collections.shuffle(lane0.getCodes());
+                                System.out.println(lane0.getCodes().toString());
+                                for (String code : lane0.getCodes()) {
+                                    System.out.println("key: " + code + "; val" + adjacencyCodeMap.get(code).toString());
+                                }
+                                lane0.sortUsingDfs(adjacencyCodeMap);
+                                System.out.println(lane0.getCodes().toString());
+
+
+                            }
+
+                        }
+
+                    }
+                }
+            }
+
+        }
+
+        for (Lane lane : lanes) {
+            lane.removeInteraction(adjacencyCodeMap);
+        }
+
+        lanes.removeIf(next -> next.getCodes().size() <= 2);
 
         System.out.println(GsonUtils.toJson(lanes));
         return R.ok().add(lanes);
     }
 
+    private void dfsCalcIncludingEnd(String start, String current, Lane lane, Set<String> visited, Map<String, List<String>> adjacencyCodeMap) {
+        // 娣诲姞褰撳墠鑺傜偣
+        lane.getCodes().add(current);
+        visited.add(current);
 
-    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) {
-            // 涓嶅寘鍚嫄寮偣
+        List<String> neighbors = adjacencyCodeMap.get(current);
+        if (neighbors == null || neighbors.isEmpty()) {
             return;
         }
 
-        // 鏍囪涓哄凡璁块棶骞跺姞鍏ュ贩閬�
-        visited.add(code);
-        lane.getCodes().add(code);
+        for (String neighbor : neighbors) {
+            if (neighbor.equals(start)) {
+                continue;
+            }
 
-        List<String> neighbors = adjacencyCodeMap.get(code);
+            if (!visited.contains(neighbor)) {
+                int degree = adjacencyCodeMap.get(neighbor).size();
+                if (degree == 2) {
+                    if (isSameDirection(current, neighbor, start)) {
+                        dfsCalcIncludingEnd(current, neighbor, lane, visited, adjacencyCodeMap);
+                    }
+                } else {
+                    // 缁堢偣鎴栨嫄寮偣锛屽寘鍚苟鍋滄
+                    lane.getCodes().add(neighbor);
+                    visited.add(neighbor);
+                }
+            }
+        }
+    }
+    private void dfsCalcForLoop(String current, String parent, Lane lane, Set<String> visited, Map<String, List<String>> adjacencyCodeMap) {
+        lane.getCodes().add(current);
+        visited.add(current);
+
+        List<String> neighbors = adjacencyCodeMap.get(current);
         if (neighbors == null || neighbors.isEmpty()) {
             return;
         }
@@ -111,22 +192,27 @@
                 continue;
             }
 
-            if (adjacencyCodeMap.getOrDefault(neighbor, Collections.emptyList()).size() == 2 && !visited.contains(neighbor)) {
-                // 妫�鏌ユ柟鍚戞槸鍚︿竴鑷�
-                if (isSameDirection(code, neighbor, parent)) {
-                    dfsCalc(neighbor, code, lane, visited, adjacencyCodeMap);
+            if (!visited.contains(neighbor)) {
+                int degree = adjacencyCodeMap.get(neighbor).size();
+                if (degree == 2) {
+                    if (isSameDirection(current, neighbor, parent)) {
+                        dfsCalcForLoop(current, neighbor, lane, visited, adjacencyCodeMap);
+                    }
+                } else {
+                    lane.getCodes().add(neighbor);
+                    visited.add(neighbor);
                 }
             }
         }
     }
 
-    public boolean isSameDirection(String code, String neighbor, String parent) {
+    public boolean isSameDirection(String current, String neighbor, String parent) {
         if (parent == null) {
             return true;
         }
 
         Code parentCode = codeService.selectByData(parent);
-        Code currentCode = codeService.selectByData(code);
+        Code currentCode = codeService.selectByData(current);
         Code neighborCode = codeService.selectByData(neighbor);
 
         double direction1 = calculateDirection(parentCode, currentCode);
@@ -140,6 +226,13 @@
         return angleDifference < Math.toRadians(3);
     }
 
+    /**
+     * 璁$畻涓や釜鐐逛箣闂寸殑鏂瑰悜瑙�
+     *
+     * @param from 璧风偣
+     * @param to 缁堢偣
+     * @return 鏂瑰悜瑙掞紙寮у害锛�
+     */
     public double calculateDirection(Code from, Code to) {
         double deltaX = to.getX() - from.getX();
         double deltaY = to.getY() - from.getY();

--
Gitblit v1.9.1