dress-graph 0.5.2 → 0.5.3

package/dress.d.ts

@@ -50,7 +50,7 @@ export interface DressResult {
  */
 export declare function dressFit(opts: DressOptions): Promise<DressResult>;
 
-export interface DressGraphOptions {
+export interface DRESSOptions {
     /** Number of vertices (vertex ids must be in 0..numVertices-1) */
     numVertices: number;
     /** Edge source vertices (0-based) */
@@ -68,9 +68,9 @@ export interface DressGraphOptions {
 /**
  * A persistent DRESS graph supporting repeated fit / get calls.
  */
-export declare class DressGraph {
+export declare class DRESS {
     private constructor();
-    static create(opts: DressGraphOptions): Promise<DressGraph>;
+    static create(opts: DRESSOptions): Promise<DRESS>;
     fit(maxIterations?: number, epsilon?: number): { iterations: number; delta: number };
     get(u: number, v: number, maxIterations?: number, epsilon?: number, edgeWeight?: number): number;
     result(): DressResult;

package/dress.js

@@ -201,13 +201,13 @@ export async function dressFit(opts) {
     };
 }
 
-// ── Persistent DressGraph class ─────────────────────────────────────
+// ── Persistent DRESS class ──────────────────────────────────────────
 
 /**
  * A persistent DRESS graph that supports repeated fit and get calls.
  *
  * Usage:
- *   const g = await DressGraph.create({
+ *   const g = await DRESS.create({
  *     numVertices: 4,
  *     sources: [0,1,2,0],
  *     targets: [1,2,3,3],
@@ -217,7 +217,7 @@ export async function dressFit(opts) {
  *   const res = g.result();          // snapshot of current results
  *   g.free();                        // explicitly free C graph
  */
-export class DressGraph {
+export class DRESS {
     /** @private */
     constructor(module, gPtr, n, e, sources, targets) {
         this._M = module;
@@ -231,7 +231,7 @@ export class DressGraph {
     }
 
     /**
-     * Create a persistent DressGraph.
+     * Create a persistent DRESS graph.
      *
      * @param {Object} opts
      * @param {number}              opts.numVertices
@@ -240,7 +240,7 @@ export class DressGraph {
      * @param {Float64Array|number[]|null} [opts.weights]
      * @param {number} [opts.variant=0]
      * @param {boolean} [opts.precomputeIntercepts=false]
-     * @returns {Promise<DressGraph>}
+     * @returns {Promise<DRESS>}
      */
     static async create(opts) {
         const M = await getModule();
@@ -272,7 +272,7 @@ export class DressGraph {
         const g = M._init_dress_graph(N, E, uPtr, vPtr, wPtr, variant, precompute);
         if (g === 0) throw new Error('init_dress_graph returned NULL');
 
-        return new DressGraph(M, g, N, E, opts.sources, opts.targets);
+        return new DRESS(M, g, N, E, opts.sources, opts.targets);
     }
 
     /**
@@ -282,7 +282,7 @@ export class DressGraph {
      * @returns {{iterations: number, delta: number}}
      */
     fit(maxIterations = 100, epsilon = 1e-6) {
-        if (!this._g) throw new Error('DressGraph already freed');
+        if (!this._g) throw new Error('DRESS already freed');
         const M = this._M;
         M._dress_fit(this._g, maxIterations, epsilon, this._iterPtr, this._deltaPtr);
         return {
@@ -301,7 +301,7 @@ export class DressGraph {
      * @returns {number}
      */
     get(u, v, maxIterations = 100, epsilon = 1e-6, edgeWeight = 1.0) {
-        if (!this._g) throw new Error('DressGraph already freed');
+        if (!this._g) throw new Error('DRESS already freed');
         return this._M._dress_get(this._g, u, v, maxIterations, epsilon, edgeWeight);
     }
 
@@ -310,7 +310,7 @@ export class DressGraph {
      * @returns {DressResult}
      */
     result() {
-        if (!this._g) throw new Error('DressGraph already freed');
+        if (!this._g) throw new Error('DRESS already freed');
         const M = this._M;
         const E = this._e;
         const N = this._n;

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "dress-graph",
-    "version": "0.5.2",
+    "version": "0.5.3",
     "description": "DRESS is a deterministic, parameter-free framework that iteratively refines the structural similarity of edges in a graph to produce a canonical fingerprint: a real-valued edge vector, obtained by converging a non-linear dynamical system to its unique fixed point. The fingerprint is isomorphism-invariant by construction, numerically stable (no overflow, no error amplification, no undefined behavior), fast and embarrassingly parallel to compute: DRESS total runtime is O(I * m * d_max) for I iterations to convergence, and convergence is guaranteed by Birkhoff contraction.",
     "type": "module",
     "main": "dress.js",