feat: dfs supports undirected graph data (#66)

Author: Yanyan-Wang

CHANGELOG.md

@@ -1,16 +1,25 @@
 # ChangeLog
+
+#### 0.1.26
+
+- feat: dfs supports undirected graph data;
+
 #### 0.1.25
 
 - feat: Optimized data preprocessing coding - when the feature values are all numerical, use the original values (plus normalization), and do not use one-hot coding
+
 #### 0.1.24
 
-- fix: i-louvain without cluster problem; 
+- fix: i-louvain without cluster problem;
+
 #### 0.1.23
 
 - perf: k-means algorithm: set K to minimum
+
 #### 0.1.22
 
 - fix: k-means algorithm, perf: louvain -- support specified parameters such as propertyKey,involvedKeys and uninvolvedKeys
+
 #### 0.1.21
 
 - perf: k-means algorithm -- Optimize parameters and return

packages/graph/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@antv/algorithm",
-  "version": "0.1.25",
+  "version": "0.1.26",
   "description": "graph algorithm",
   "keywords": [
     "graph",

packages/graph/src/dfs.ts

@@ -1,5 +1,5 @@
-import { IAlgorithmCallbacks, GraphData } from './types'
-import { getNeighbors } from './util'
+import { IAlgorithmCallbacks, GraphData } from './types';
+import { getNeighbors } from './util';
 
 function initCallbacks(callbacks: IAlgorithmCallbacks = {} as IAlgorithmCallbacks) {
   const initiatedCallback = callbacks;
@@ -35,23 +35,24 @@ function depthFirstSearchRecursive(
   currentNode: string,
   previousNode: string,
   callbacks: IAlgorithmCallbacks,
+  directed: boolean = true,
 ) {
   callbacks.enter({
     current: currentNode,
     previous: previousNode,
   });
 
-  const { edges = [] } = graphData
+  const { edges = [] } = graphData;
 
-  getNeighbors(currentNode, edges, 'target').forEach((nextNode) => {
+  getNeighbors(currentNode, edges, directed ? 'target' : undefined).forEach((nextNode) => {
     if (
       callbacks.allowTraversal({
         previous: previousNode,
         current: currentNode,
         next: nextNode,
       })
     ) {
-      depthFirstSearchRecursive(graphData, nextNode, currentNode, callbacks);
+      depthFirstSearchRecursive(graphData, nextNode, currentNode, callbacks, directed);
     }
   });
 
@@ -71,6 +72,7 @@ export default function depthFirstSearch(
   graphData: GraphData,
   startNodeId: string,
   callbacks?: IAlgorithmCallbacks,
+  directed: boolean = true,
 ) {
-  depthFirstSearchRecursive(graphData, startNodeId, '', initCallbacks(callbacks));
+  depthFirstSearchRecursive(graphData, startNodeId, '', initCallbacks(callbacks), directed);
 }