dress-graph 0.4.0 → 0.5.0

package/README.md

@@ -2,28 +2,19 @@
 
 **A Continuous Framework for Structural Graph Refinement**
 
-DRESS is a provably continuous relaxation of the Weisfeiler–Leman algorithm.
-At depth k, higher-order DRESS is **provably at least as powerful as (k+2)-WL**
-in expressiveness — the base algorithm (k=0) already matches 2-WL, and each
-level adds one WL dimension.
-Yet it is dramatically cheaper to compute: a single DRESS run costs
-O(I · m · d_max) where I is the number of iterations, and depth-k requires
-C(n,k) independent runs — a total of O(C(n,k) · I · m · d_max), compared to
-O(n^(k+3)) for (k+2)-WL.  Space complexity is O(n + m), compared to
-O(n^(k+2)) for (k+2)-WL.
-The algorithm is embarrassingly parallel in two orthogonal ways — across the
-C(n,k) subproblems and across edge updates within each iteration — enabling
-distributed/cloud and multi-core/GPU/SIMD implementations.
+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.
 
 ## Quick start
 
 ```javascript
-const dress = require('./dress_wasm.cjs');
+import { dressFit } from 'dress-graph';
 
-dress.onReady(() => {
-  const result = dress.dressFit(4, [0, 1, 2, 0], [1, 2, 3, 3]);
-  console.log(result.edgeDress);
+const result = await dressFit({
+  numVertices: 4,
+  sources:     [0, 1, 2, 0],
+  targets:     [1, 2, 3, 3],
 });
+console.log(result.edgeDress);
 ```
 
 For the full API and documentation, see the [main repository](https://github.com/velicast/dress-graph).

package/dress.js

@@ -402,6 +402,8 @@ export async function deltaDressFit(opts) {
     const epsilon     = opts.epsilon ?? 1e-6;
     const precompute  = (opts.precompute ?? false) ? 1 : 0;
     const keepMS      = (opts.keepMultisets ?? false) ? 1 : 0;
+    const offset      = opts.offset ?? 0;
+    const stride      = opts.stride ?? 1;
 
     // Allocate C arrays (ownership transfers to init_dress_graph)
     const uPtr = M._malloc(E * 4);
@@ -444,9 +446,9 @@ export async function deltaDressFit(opts) {
         M.setValue(numSubPtr + 4, 0, 'i32');
     }
 
-    // Call delta_dress_fit  (returns int64_t* — pointer to histogram on heap)
-    const histPtr = M._delta_dress_fit(g, k, maxIter, epsilon, histSizePtr,
-                                 keepMS, msPtrPtr, numSubPtr);
+    // Call delta_dress_fit_strided  (returns int64_t* — pointer to histogram on heap)
+    const histPtr = M._delta_dress_fit_strided(g, k, maxIter, epsilon, histSizePtr,
+                                 keepMS, msPtrPtr, numSubPtr, offset, stride);
 
     const histSize = M.getValue(histSizePtr, 'i32');
 

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "dress-graph",
-    "version": "0.4.0",
+    "version": "0.5.0",
     "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",