@thi.ng/adjacency 2.4.0 → 2.4.1

package/CHANGELOG.md

@@ -1,6 +1,6 @@
 # Change Log
 
-- **Last updated**: 2023-10-18T18:06:31Z
+- **Last updated**: 2023-10-19T08:38:06Z
 - **Generator**: [thi.ng/monopub](https://thi.ng/monopub)
 
 All notable changes to this project will be documented in this file.

package/README.md

@@ -73,7 +73,7 @@ For Node.js REPL:
 const adjacency = await import("@thi.ng/adjacency");
 ```
 
-Package sizes (brotli'd, pre-treeshake): ESM: 2.54 KB
+Package sizes (brotli'd, pre-treeshake): ESM: 2.57 KB
 
 ## Dependencies
 
@@ -104,14 +104,15 @@ TODO
 
 ## Authors
 
-- [Karsten Schmidt](https://thi.ng)
+- [Karsten Schmidt](https://thi.ng) (Main author)
+- [Igor Loskutov](https://github.com/Firfi)
 
 If this project contributes to an academic publication, please cite it as:
 
 ```bibtex
 @misc{thing-adjacency,
   title = "@thi.ng/adjacency",
-  author = "Karsten Schmidt",
+  author = "Karsten Schmidt and others",
   note = "https://thi.ng/adjacency",
   year = 2018
 }

package/api.d.ts

@@ -38,6 +38,12 @@ export interface IGraph<T = number> {
      * @param to -
      */
     hasEdge(from: T, to: T): boolean;
+    /**
+     * Returns true if a vertex exists for the given id.
+     *
+     * @param id -
+     */
+    hasVertex(id: T): boolean;
     /**
      * Returns number of edges for given vertex. By default only outgoing edges
      * are counted, but can be customized via given {@link DegreeType}. Note: In

package/binary.d.ts

@@ -23,6 +23,7 @@ export declare class AdjacencyBitMatrix implements IGraph<number> {
     addEdge(from: number, to: number): boolean;
     removeEdge(from: number, to: number): boolean;
     hasEdge(from: number, to: number): boolean;
+    hasVertex(id: number): boolean;
     degree(id: number, type?: DegreeType): number;
     neighbors(id: number): number[];
     similarity(id: number, threshold?: number): number[][];

package/binary.js

@@ -57,6 +57,9 @@ export class AdjacencyBitMatrix {
     hasEdge(from, to) {
         return this.mat.at(from, to) !== 0;
     }
+    hasVertex(id) {
+        return (this.mat.popCountRow(id) !== 0 || this.mat.popCountColumn(id) !== 0);
+    }
     degree(id, type = "out") {
         let degree = 0;
         if (this.undirected || type !== "in")

package/list.d.ts

@@ -12,6 +12,7 @@ export declare class AdjacencyList implements IGraph<number> {
     edges(): Generator<Edge, void, unknown>;
     addVertex(id: number): void;
     removeVertex(id: number): boolean;
+    hasVertex(id: number): boolean;
     addEdge(from: number, to: number): boolean;
     removeEdge(from: number, to: number): boolean;
     hasEdge(from: number, to: number): boolean;

package/list.js

@@ -55,6 +55,9 @@ export class AdjacencyList {
         this.numV--;
         return true;
     }
+    hasVertex(id) {
+        return !!this.adjacency[id];
+    }
     addEdge(from, to) {
         const vertex = this.ensureVertexData(from);
         this.ensureVertexData(to);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@thi.ng/adjacency",
-  "version": "2.4.0",
+  "version": "2.4.1",
   "description": "Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs",
   "type": "module",
   "module": "./index.js",
@@ -22,6 +22,9 @@
     }
   ],
   "author": "Karsten Schmidt (https://thi.ng)",
+  "contributors": [
+    "Igor Loskutov (https://github.com/Firfi)"
+  ],
   "license": "Apache-2.0",
   "scripts": {
     "build": "yarn clean && tsc --declaration",
@@ -122,5 +125,5 @@
     ],
     "year": 2018
   },
-  "gitHead": "46e445c09f2909d1aeaa9fdc8d8b3aa61c114db2\n"
+  "gitHead": "ae301a8a5f13f518dec04a975479c6e779a8ca9e\n"
 }

package/sparse.d.ts

@@ -7,6 +7,7 @@ export declare class AdjacencyMatrix extends CSR implements IGraph<number> {
     addEdge(from: number, to: number): boolean;
     removeEdge(from: number, to: number): boolean;
     hasEdge(from: number, to: number): boolean;
+    hasVertex(id: number): boolean;
     numEdges(): number;
     numVertices(): number;
     degree(id: number, type?: DegreeType): number;

package/sparse.js

@@ -38,6 +38,9 @@ export class AdjacencyMatrix extends CSR {
     hasEdge(from, to) {
         return this.at(from, to) !== 0;
     }
+    hasVertex(id) {
+        return this.degree(id, "inout") > 0;
+    }
     numEdges() {
         const n = this.data.length;
         return this.undirected ? n / 2 : n;