feat: 支持获取到图中某个节点的所有的子元素

DPDFE · Dec 8, 2023 · 0a11159 · 0a11159
1 parent f9c5368
commit 0a11159
Show file tree

Hide file tree

Showing 3 changed files with 62 additions and 2 deletions.
diff --git a/packages/event/__tests__/dag.test.ts b/packages/event/__tests__/dag.test.ts
@@ -18,4 +18,7 @@ test('dag', () => {
 
     console.log(dag.hasCycle());
     console.log(dag.findParents(5));
+    console.log(dag.findParents(5, { include_self: false }));
+    console.log(dag.findChildren(4));
+    console.log(dag.findChildren(4, { include_self: false }));
 });
diff --git a/packages/event/package.json b/packages/event/package.json
@@ -1,6 +1,6 @@
 {
     "name": "@dpdfe/event-utils",
-    "version": "0.0.26",
+    "version": "0.0.27",
     "description": "通用方法",
     "author": "pearone",
     "homepage": "https://github.com/DPDFE/react-layout/tree/main/packages/event",

diff --git a/packages/event/src/graph.ts b/packages/event/src/graph.ts
@@ -195,12 +195,69 @@ class DAG {
         return false;
     }
 
+    /** 找到所有的子节点 */
+    findChildren(
+        node: OriginGraphNodeType,
+        options: {
+            /** 包含自己 */
+            include_self: boolean;
+        } = { include_self: true }
+    ) {
+        const children: Set<OriginGraphNodeType> = new Set();
+        const stack: Set<OriginGraphNodeType> = new Set();
+
+        this.detectChild(node, children, stack);
+        if (!options.include_self) {
+            children.delete(node);
+        }
+        return children;
+    }
+
+    /** 获取子元素 */
+    detectChild(
+        node: OriginGraphNodeType,
+        visited: Set<OriginGraphNodeType>,
+        stack: Set<OriginGraphNodeType>
+    ) {
+        if (stack.has(node)) {
+            // 如果当前节点已经在递归栈中
+            return;
+        }
+        if (visited.has(node)) {
+            // 如果当前节点已经访问过，则不需要再继续探索
+            return;
+        }
+
+        visited.add(node);
+        stack.add(node);
+
+        const children = this.children.get(node)!;
+
+        for (const parent of children.values()) {
+            if (this.detectChild(parent, visited, stack)) {
+                return true;
+            }
+        }
+
+        stack.delete(node);
+        return;
+    }
+
     /** 找到所有的父节点 */
-    findParents(node: OriginGraphNodeType) {
+    findParents(
+        node: OriginGraphNodeType,
+        options: {
+            /** 包含自己 */
+            include_self: boolean;
+        } = { include_self: true }
+    ) {
         const parents: Set<OriginGraphNodeType> = new Set();
         const stack: Set<OriginGraphNodeType> = new Set();
 
         this.detectParent(node, parents, stack);
+        if (!options.include_self) {
+            parents.delete(node);
+        }
         return parents;
     }