feat: add GraphView supports (#7)

* feat: add GraphView supports

* feat: Add cache mode for GraphView && Add both edge cache for Graph.

* perf: optimize code of getting related nodes.

* feat: add tree traversing

* feat: update README and docs

* fix: reduce changes for data replacing

Author: YiSiWang

.gitignore

@@ -15,7 +15,7 @@
 /dist
 
 # docs
-/docs
+# /docs
 
 # Bundle visualizer
 stats.html

README.md

@@ -6,38 +6,21 @@
 
 ![build status](https://img.shields.io/github/workflow/status/antvis/graphlib/Build) ![coverage status](https://img.shields.io/codecov/c/github/antvis/graphlib)
 
-## Content of Package
+## Features
 
-### Namespaces
+- Manage graph structure data with simple APIs.
+- Easily batch multiple changes for performance optimization.
+- GraphView for efficient data transformation.
 
-- [algorithm](docs/modules/algorithm.md)
-- [comparision](docs/modules/comparision.md)
-- [essence](docs/modules/essence.md)
-- [generate](docs/modules/generate.md)
+## API
 
 ### Classes
 
 - [Graph](docs/classes/Graph.md)
-- [GraphWithEvent](docs/classes/GraphWithEvent.md)
+- [GraphView](docs/classes/GraphView.md)
 
 ## Change Log
 
-#### 1.2.0
+#### 2.0
 
-- 🎉 `GraphWithEvent` now you can use graph with event listener
-- 🎉 `essece` module for graph basic essence property check
-- 🎉 `generate` module for graph generate new graph, now support graph's complement;
--
-
-#### 1.1.0
-
-- 🎉 Now we have comparision module for graph comparing with nodes/edges/options even subgraph
-- 💪 Add isGraph to check if a object is a "Graph", and add a self loop checking function
-
-#### 1.0.1
-
-- 🔨 Completes test and bring all to 100%
-
-#### 1.0.0
-
-- 🎉 Release new graphlib with graph and algorithm
+- 🎉 Release new version

__tests__/graph.spec.ts

@@ -47,6 +47,23 @@ test('reduceChanges', () => {
         oldValue: 2,
         newValue: 3,
       },
+      {
+        type: 'NodeDataUpdated',
+        id: 'B',
+        propertyName: 'foo',
+        oldValue: 1,
+        newValue: 2,
+      },
+      {
+        type: 'NodeDataUpdated',
+        id: 'B',
+        oldValue: {
+          foo: 2,
+        },
+        newValue: {
+          bar: 3,
+        },
+      },
       {
         type: 'EdgeDataUpdated',
         id: 'A',
@@ -70,6 +87,16 @@ test('reduceChanges', () => {
       oldValue: 1,
       newValue: 3,
     },
+    {
+      type: 'NodeDataUpdated',
+      id: 'B',
+      oldValue: {
+        foo: 2,
+      },
+      newValue: {
+        bar: 3,
+      },
+    },
     {
       type: 'EdgeDataUpdated',
       id: 'A',
@@ -250,6 +277,14 @@ test('bsf', () => {
     nodeIdList.push(node.id);
   });
   expect(nodeIdList).toEqual([0, 1, 2, 3]);
+
+  // Abort on 1.
+  nodeIdList.length = 0;
+  graph.bfs(0, (node) => {
+    nodeIdList.push(node.id);
+    if (node.id === 1) return true;
+  });
+  expect(nodeIdList).toEqual([0, 1]);
 });
 
 test('dsf', () => {
@@ -273,6 +308,14 @@ test('dsf', () => {
     nodeIdList.push(node.id);
   });
   expect(nodeIdList).toEqual([0, 1, 3, 2]);
+
+  // Abort on 1.
+  nodeIdList.length = 0;
+  graph.dfs(0, (node) => {
+    nodeIdList.push(node.id);
+    if (node.id === 1) return true;
+  });
+  expect(nodeIdList).toEqual([0, 1]);
 });
 
 test('clone', () => {