refactor(adjacency): update destructuring

thi-ng · Nov 14, 2020 · 3524982 · 3524982
1 parent 7af7a92
commit 3524982
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 7 deletions.
diff --git a/packages/adjacency/src/bfs.ts b/packages/adjacency/src/bfs.ts
@@ -20,9 +20,7 @@ export class BFS {
 
     search(ids: Iterable<number>, cost: CostFn = () => 1) {
         const queue = new DCons<number>(ids);
-        const dist = this.dist;
-        const edges = this.edges;
-        const marked = this.marked;
+        const { dist, edges, marked } = this;
         dist.fill(0xffffffff);
         for (let id of ids) {
             dist[id] = 0;
@@ -49,8 +47,7 @@ export class BFS {
     pathTo(id: number) {
         if (!this.hasPathTo(id)) return;
         const path: number[] = [];
-        const dist = this.dist;
-        const edges = this.edges;
+        const { dist, edges } = this;
         let i = id;
         for (; dist[i] > 0; i = edges[i]) {
             path.push(i);

diff --git a/packages/adjacency/src/sparse.ts b/packages/adjacency/src/sparse.ts
@@ -47,8 +47,7 @@ export class AdjacencyMatrix extends CSR implements IGraph {
     }
 
     *edges() {
-        const rows = this.rows;
-        const cols = this.cols;
+        const { cols, rows } = this;
         const directed = !this.undirected;
         for (let i = 0; i < this.m; i++) {
             const jj = rows[i + 1];