@qe-libs/rena-wasm 0.1.5 → 0.1.7

package/README.md

@@ -91,6 +91,26 @@ const model = ena.fit(rows, { codes, units, conversations, window: 4, weightMode
 
 ---
 
+## Reduced-Code Search (PRIA)
+
+`pria()` finds the largest set of codes (up to `removeNum`, never leaving
+fewer than 3) whose removal keeps the model within `threshold` of the full
+model — the same search, gates and tie-break as R's `PRIA::pria()`. It takes
+the same options as `fit()` (rotation, `weightModel`, `tensor`, `codeMask`,
+…), so it scores the model you display.
+
+```js
+const { removed, k, variance } = ena.pria(rows, {
+  codes, units, conversations, window: 4,
+  rotation: 'mean', groupA, groupB,
+  removeNum: 3, threshold: 0.95,
+});
+// removed  → code names to drop (most codes first, then highest dim-1 variance)
+// variance → dim-1 share of variance in the chosen reduced model
+```
+
+---
+
 ## Accumulation Only
 
 Returns raw (un-normalised) network vectors without running the full pipeline.
@@ -116,7 +136,13 @@ columns in the data.
 // dims = [nRoleValues, 2]  →  Teacher uses window=4, Student uses window=2.
 const model = ena.fit(rows, {
   codes, units, conversations,
-  ordered: true,   // directed (n² connections); also works without a tensor
+  ordered: true,   // directed (n² connections); also works without a tensor.
+                   // Ordered models follow ona::model(): zero-network units are
+                   // left out of the centring mean but shifted by it, nodes use
+                   // directed positions, and points/nodes are centred on the origin.
+                   // connectionNames / rotation.adjacencyKey list all n² directed
+                   // connections as R names them: column j*n + i is
+                   // "codes[i] & codes[j]", ground codes[i] → response codes[j].
   tensor: {
     dims:         [2, 2],   // [nRoleValues=2, weight/window=2]
     dimsSender:   [0],      // axis 0 is a sender factor

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@qe-libs/rena-wasm",
-  "version": "0.1.5",
+  "version": "0.1.7",
   "description": "JavaScript/WebAssembly ENA pipeline — thin orchestration layer over @qe-libs/libqe-wasm",
   "main": "src/index.js",
   "type": "module",

package/src/index.js

@@ -90,19 +90,45 @@ function computeVariance(points, nUnits, dims) {
 
 /**
  * Build the adjacency key — list of [codeA, codeB] pairs for each connection.
- * Matches R's enadata$adjacency.matrix (column-major upper triangle order).
+ * Matches R's rotation$adjacency.key.
+ *
+ * Unordered: the upper triangle in column-major order (choose_two(n) pairs).
+ * Ordered: all n² directed connections in column-major order — column
+ * j*n + i is [codes[i], codes[j]], ground codes[i] → response codes[j]
+ * (as R names it "codes[i] & codes[j]").
  *
  * @param {string[]} codes
+ * @param {boolean}  [ordered=false]
  * @returns {string[][]}  length nConnections, each entry is [codeI, codeJ]
  */
-function buildAdjacencyKey(codes) {
+function buildAdjacencyKey(codes, ordered = false) {
     const key = [];
+    if (ordered) {
+        for (let j = 0; j < codes.length; j++)
+            for (let i = 0; i < codes.length; i++)
+                key.push([codes[i], codes[j]]);
+        return key;
+    }
     for (let j = 1; j < codes.length; j++)
         for (let i = 0; i < j; i++)
             key.push([codes[i], codes[j]]);
     return key;
 }
 
+/**
+ * Connection names, "codeA & codeB" per connection, in network column order
+ * (= R's colnames(set$connection.counts)).
+ *
+ * @param {object}   qe
+ * @param {string[]} codes
+ * @param {boolean}  [ordered=false]
+ * @returns {string[]}
+ */
+function connectionNamesFor(qe, codes, ordered = false) {
+    if (!ordered) return qe.connection_names(codes);
+    return buildAdjacencyKey(codes, true).map(([a, b]) => `${a} & ${b}`);
+}
+
 // ── ENA result object ─────────────────────────────────────────────────────────
 
 class ENAModel {
@@ -210,20 +236,58 @@ function weightModelName(name) {
     }
 }
 
+// ── code masking ─────────────────────────────────────────────────────────────
+
+/**
+ * Zero, in place, every connection column the code mask excludes.
+ * codeMask is an nCodes × nCodes 0/1 matrix; a 0 at [a][b] drops the
+ * connection between codes a and b (unordered: either orientation drops the
+ * pair; ordered: codeMask[j][i] === 0 drops the directed column i*n + j).
+ *
+ * @param {Float64Array} networks   nUnits × nConnections, row-major
+ * @param {number[][]}   codeMask
+ * @param {number}       nCodes
+ * @param {number}       nUnits
+ * @param {number}       nConnections
+ * @param {boolean}      ordered
+ */
+function applyCodeMask(networks, codeMask, nCodes, nUnits, nConnections, ordered) {
+    if (!codeMask || codeMask.length !== nCodes) return;
+    const zeroColumn = (k) => {
+        for (let u = 0; u < nUnits; u++) networks[u * nConnections + k] = 0;
+    };
+    if (ordered) {
+        for (let j = 0; j < nCodes; j++)
+            for (let i = 0; i < nCodes; i++)
+                if (codeMask[j] && codeMask[j][i] === 0) zeroColumn(i * nCodes + j);
+        return;
+    }
+    let k = 0;
+    for (let col = 1; col < nCodes; col++) {
+        for (let row = 0; row < col; row++) {
+            if ((codeMask[row] && codeMask[row][col] === 0) ||
+                (codeMask[col] && codeMask[col][row] === 0)) zeroColumn(k);
+            k++;
+        }
+    }
+}
+
 // ── shared pipeline (post-accumulation) ──────────────────────────────────────
 
 function runPipeline(qe, rawNetworks, nUnits, nConnections, codes, unitLabels,
                      metaData, rotMethod, groupA, groupB, dims, gParams,
-                     rowConnectionCounts = null) {
-    const connectionNames = qe.connection_names(codes);
+                     rowConnectionCounts = null, ordered = false) {
+    const connectionNames = connectionNamesFor(qe, codes, ordered);
 
     // Sphere norm → lineWeights (= R's set$line.weights)
     const lineWeights = sphereNorm(qe, rawNetworks, nUnits, nConnections);
 
     // Center → pointsForProjection (= R's model$points.for.projection)
     //          centerVec             (= R's rotation$center.vec)
+    // Ordered (ONA) models follow ona::model(): zero-network units are left
+    // out of the mean but still shifted by it.
     const { centered: pointsForProjection, centerVec } =
-        center(qe, lineWeights, nUnits, nConnections);
+        center(qe, lineWeights, nUnits, nConnections, ordered);
 
     // Rotate
     let rot;
@@ -241,6 +305,9 @@ function runPipeline(qe, rawNetworks, nUnits, nConnections, codes, unitLabels,
         rot = rotateSVD(qe, pointsForProjection, nUnits, nConnections);
     }
 
+    // Never ask for more dimensions than the rotation has columns.
+    dims = Math.min(dims, rot.rotCols);
+
     // Truncate rotation matrix to dims columns (= R's set$rotation.matrix)
     const rotationMatrix = new Float64Array(rot.rotRows * dims);
     for (let r = 0; r < rot.rotRows; r++)
@@ -259,15 +326,30 @@ function runPipeline(qe, rawNetworks, nUnits, nConnections, codes, unitLabels,
     // Matches rENA's lws.positions.sq, which regresses the projected points onto
     // the SPHERE-normed line weights (enaset$line.weights) — not the centered
     // networks.  Verified node-for-node against R rENA on rs.data.new.csv.
+    // Ordered (ONA) models use libqe's directed_node_positions, as
+    // ona::model() does (via rENA's optimize()).
     const { nodes, centroids } = nodePositions(
-        qe, lineWeights, nUnits, nConnections, points, dims
+        qe, lineWeights, nUnits, nConnections, points, dims, ordered
     );
 
+    // ONA: translate points and nodes so the points' mean is at the origin
+    // (ona::model's center_to_origin; centroids are left as computed, as in R).
+    if (ordered) {
+        const nCodes = nodes.length / dims;
+        for (let d = 0; d < dims; d++) {
+            let mean = 0;
+            for (let u = 0; u < nUnits; u++) mean += points[u * dims + d];
+            mean /= nUnits;
+            for (let u = 0; u < nUnits; u++) points[u * dims + d] -= mean;
+            for (let c = 0; c < nCodes; c++) nodes[c * dims + d] -= mean;
+        }
+    }
+
     // Variance explained (= R's model$variance)
     const variance = computeVariance(points, nUnits, dims);
 
     // Adjacency key (= R's rotation$adjacency.key)
-    const adjacencyKey = buildAdjacencyKey(codes);
+    const adjacencyKey = buildAdjacencyKey(codes, ordered);
 
     return new ENAModel({
         // top-level
@@ -371,38 +453,11 @@ export default async function loadENA() {
             );
             const nConnections = ordered ? nCodes * nCodes : qe.choose_two(nCodes);
 
-            // Apply code masking by zeroing out the masked connection columns across all units
-            if (codeMask && codeMask.length === codes.length) {
-                console.log('[rena-wasm] Applying code mask to raw networks...');
-                if (ordered) {
-                    for (let j = 0; j < codes.length; j++) {
-                        for (let i = 0; i < codes.length; i++) {
-                            if (codeMask[j] && codeMask[j][i] === 0) {
-                                const k = i * codes.length + j;
-                                for (let u = 0; u < nUnits; u++) {
-                                    rawNetworks[u * nConnections + k] = 0;
-                                }
-                            }
-                        }
-                    }
-                } else {
-                    let k = 0;
-                    for (let col = 1; col < codes.length; col++) {
-                        for (let row = 0; row < col; row++) {
-                            if ((codeMask[row] && codeMask[row][col] === 0) || (codeMask[col] && codeMask[col][row] === 0)) {
-                                for (let u = 0; u < nUnits; u++) {
-                                    rawNetworks[u * nConnections + k] = 0;
-                                }
-                            }
-                            k++;
-                        }
-                    }
-                }
-            }
+            applyCodeMask(rawNetworks, codeMask, codes.length, nUnits, nConnections, ordered);
 
             return runPipeline(qe, rawNetworks, nUnits, nConnections, codes,
                                unitLabels, metaData, rotMethod, groupA, groupB,
-                               dims, gParams, rowConnectionCounts);
+                               dims, gParams, rowConnectionCounts, ordered);
         },
 
         /**
@@ -444,36 +499,9 @@ export default async function loadENA() {
             );
             const nConnections = ordered ? nCodes * nCodes : qe.choose_two(nCodes);
 
-            // Apply code masking by zeroing out the masked connection columns across all units
-            if (codeMask && codeMask.length === codes.length) {
-                console.log('[rena-wasm] Applying code mask to accumulated networks...');
-                if (ordered) {
-                    for (let j = 0; j < codes.length; j++) {
-                        for (let i = 0; i < codes.length; i++) {
-                            if (codeMask[j] && codeMask[j][i] === 0) {
-                                const k = i * codes.length + j;
-                                for (let u = 0; u < nUnits; u++) {
-                                    networks[u * nConnections + k] = 0;
-                                }
-                            }
-                        }
-                    }
-                } else {
-                    let k = 0;
-                    for (let col = 1; col < codes.length; col++) {
-                        for (let row = 0; row < col; row++) {
-                            if ((codeMask[row] && codeMask[row][col] === 0) || (codeMask[col] && codeMask[col][row] === 0)) {
-                                for (let u = 0; u < nUnits; u++) {
-                                    networks[u * nConnections + k] = 0;
-                                }
-                            }
-                            k++;
-                        }
-                    }
-                }
-            }
+            applyCodeMask(networks, codeMask, codes.length, nUnits, nConnections, ordered);
 
-            const connectionNames = qe.connection_names(codes);
+            const connectionNames = connectionNamesFor(qe, codes, ordered);
             return {
                 connectionCounts: networks, rowConnectionCounts, unitLabels, connectionNames,
                 metaData, nUnits, nConnections,
@@ -538,7 +566,8 @@ export default async function loadENA() {
                 );
                 const model = runPipeline(
                     qe, raw, nUnits, nConnections, codes,
-                    unitLabels, metaData, 'svd', undefined, undefined, dims
+                    unitLabels, metaData, 'svd', undefined, undefined, dims,
+                    undefined, null, ordered
                 );
                 allPoints.push(model.points);
             }
@@ -676,12 +705,27 @@ export default async function loadENA() {
          * removed while keeping the model's goodness-of-fit within `threshold`
          * of the full model.  Brute-force subset search matching R
          * PRIA::pria(): for k = 1..removeNum, over every k-subset of codes,
-         * build the reduced model (fit with a codeMask that drops every
-         * connection touching a removed code), gate on
-         * min_d(gof_reduced[d] / gof_full[d]) >= threshold where gof is the
-         * per-dimension ena_correlation(points, centroids), and keep the subset
-         * with the MOST codes removed, then the highest reduced dim-1 variance.
+         * build the reduced model (drop every connection touching a removed
+         * code, as R's remove.codes.from.accum does), gate on min_d(gof_reduced[d] / gof_full[d]) >= threshold where
+         * gof is the per-dimension ena_correlation(points, centroids) on dims
+         * 1:2, then on point and retained-node correlations, and keep the
+         * subset with the MOST codes removed, then the highest reduced dim-1
+         * variance (= R's reduced.set$model$variance[1]).
+         *
+         * The full and reduced models are built from the same accumulation as
+         * fit() with the same options — weightModel, tensor and codeMask
+         * included — so PRIA scores the model the caller actually displays.
+         * The data are accumulated once; each candidate only drops the removed
+         * codes' connection columns and re-runs normalize → center → rotate →
+         * project.
          *
+         * @param {Object[]} rows
+         * @param {object}   opts  - fit() options (codes, units, conversations,
+         *                           window, binary, ordered, tensor, weightModel,
+         *                           codeMask, rotation, groupA, groupB, gParams)
+         *                           plus removeNum (default 3) and threshold
+         *                           (default 0.95). `dims` is ignored: scoring
+         *                           uses dims 1:2 and the variance uses all dims.
          * @returns {{ removed: string[], removedIndices: number[], k: number,
          *             variance: (number|null) }}
          */
@@ -689,7 +733,8 @@ export default async function loadENA() {
             const {
                 codes, units, conversations,
                 window: windowSize = 4, binary = true, ordered = false,
-                rotation = 'svd', dims = 2, gParams, groupA, groupB,
+                tensor: tensorDef, weightModel, codeMask,
+                rotation = 'svd', gParams, groupA, groupB,
                 removeNum = 3, threshold = 0.95,
             } = opts;
             if (!codes?.length)         throw new Error('opts.codes is required');
@@ -701,32 +746,77 @@ export default async function loadENA() {
             const empty = { removed: [], removedIndices: [], k: 0, variance: null };
             if (rn < 1) return empty;
 
-            const gofDims  = Math.min(dims, 2);       // R scores on dims 1:2
-            const baseOpts = { codes, units, conversations, window: windowSize,
-                               binary, ordered, rotation, dims, gParams, groupA, groupB };
+            // Accumulate once, exactly as fit() would for these options.
+            const { codeMatrix, nRows, nCodes, nUnits, unitLabels,
+                    unitOf, convoGroups, metaData } =
+                parseData(rows, codes, units, conversations);
+            const { networks: raw } = accumulateTensor(
+                qe, rows, codeMatrix, nRows, nCodes, nUnits,
+                unitOf, convoGroups, tensorDef ?? defaultTensor(windowSize),
+                ordered, binary, weightModelName(weightModel)
+            );
+            const nConnections = ordered ? nCodes * nCodes : qe.choose_two(nCodes);
+            applyCodeMask(raw, codeMask, nCodes, nUnits, nConnections, ordered);
+
+            // Build a model from the accumulation with `removedSet`'s codes
+            // DROPPED -- their connection columns removed and the code list
+            // shortened -- as R PRIA's remove.codes.from.accum() does. Zeroing
+            // the columns instead is not equivalent: libqe's GMR rotation is
+            // sensitive to all-zero columns. All dimensions are kept so
+            // model.variance is the full-spectrum ratio R uses; the gates read
+            // only dims 1:2.
+            const fitWithout = (removedSet) => {
+                let networks = raw, keptCodes = codes, nConn = nConnections;
+                if (removedSet) {
+                    const keep = (c) => !removedSet.has(c);
+                    const cols = [];
+                    if (ordered) {
+                        for (let i = 0; i < nCodes; i++)
+                            for (let j = 0; j < nCodes; j++)
+                                if (keep(i) && keep(j)) cols.push(i * nCodes + j);
+                    } else {
+                        let k = 0;
+                        for (let col = 1; col < nCodes; col++)
+                            for (let row = 0; row < col; row++, k++)
+                                if (keep(row) && keep(col)) cols.push(k);
+                    }
+                    nConn = cols.length;
+                    networks = new Float64Array(nUnits * nConn);
+                    for (let u = 0; u < nUnits; u++)
+                        for (let c = 0; c < nConn; c++)
+                            networks[u * nConn + c] = raw[u * nConnections + cols[c]];
+                    keptCodes = codes.filter((_, i) => keep(i));
+                }
+                return runPipeline(qe, networks, nUnits, nConn, keptCodes,
+                                   unitLabels, metaData, rotation, groupA, groupB,
+                                   nConn, gParams, null, ordered);
+            };
 
-            const D = gofDims;  // score on the first 2 dims (R's get_pria_scores_2Ds)
-            // Extract a D-column submatrix (given row indices) from a flat
-            // row-major (nRows × dims) array.
-            const sub = (flat, rowIdxs) => {
+            const D = 2;  // score on the first 2 dims (R's get_pria_scores_2Ds)
+            // D-column submatrix (given row indices) of a model's flat
+            // row-major (nRows × model.dims) array.
+            const sub = (mdl, flat, rowIdxs) => {
                 const out = new Float64Array(rowIdxs.length * D);
-                rowIdxs.forEach((r, t) => { for (let d = 0; d < D; d++) out[t * D + d] = flat[r * dims + d]; });
+                rowIdxs.forEach((r, t) => {
+                    for (let d = 0; d < D; d++) out[t * D + d] = flat[r * mdl.dims + d];
+                });
                 return out;
             };
             // ena_correlation(A, B) → [r_dim0, r_dim1] (col 0 of the dims×3 result).
-            const corr2 = (Aflat, Bflat, nRows) => {
-                const r = qe.ena_correlation(Array.from(Aflat), nRows, D,
-                                             Array.from(Bflat), nRows, D, 0.95);
+            const corr2 = (Aflat, Bflat, n) => {
+                const r = qe.ena_correlation(Array.from(Aflat), n, D,
+                                             Array.from(Bflat), n, D, 0.95);
                 const out = [];
                 for (let d = 0; d < D; d++) out.push(r.data[d * 3]);
                 return out;
             };
-            const full   = api.fit(rows, baseOpts);
-            const nUnits = full.nUnits;
+
+            const full     = fitWithout(null);
             const unitRows = Array.from({ length: nUnits }, (_, i) => i);
-            const gofOf    = (mdl) => corr2(sub(mdl.points, unitRows), sub(mdl.model.centroids, unitRows), nUnits);
+            const gofOf    = (mdl) => corr2(sub(mdl, mdl.points, unitRows),
+                                            sub(mdl, mdl.model.centroids, unitRows), nUnits);
             const gFull    = gofOf(full);
-            const fullPts2 = sub(full.points, unitRows);
+            const fullPts2 = sub(full, full.points, unitRows);
 
             // All k-subsets of [0..m) as index arrays.
             const combos = (n, k) => {
@@ -743,15 +833,7 @@ export default async function loadENA() {
             for (let k = 1; k <= rn; k++) {
                 for (const idxs of combos(m, k)) {
                     const removedSet = new Set(idxs);
-                    const mask = [];
-                    for (let i = 0; i < m; i++) {
-                        const row = [];
-                        for (let j = 0; j < m; j++) {
-                            row.push((removedSet.has(i) || removedSet.has(j)) ? 0 : 1);
-                        }
-                        mask.push(row);
-                    }
-                    const red = api.fit(rows, { ...baseOpts, codeMask: mask });
+                    const red = fitWithout(removedSet);
 
                     // Gate 1 — goodness-of-fit ratio vs full, per dim.
                     const gRed = gofOf(red);
@@ -764,21 +846,22 @@ export default async function loadENA() {
                     // Gate 2 — reduced points AND retained-code nodes must each
                     // correlate >= threshold with the full model (per dim, with a
                     // per-dim sign flip that negates the node corr alongside it).
+                    // The reduced model's nodes are the retained codes only, in order.
                     const retained = [];
                     for (let i = 0; i < m; i++) if (!removedSet.has(i)) retained.push(i);
-                    let [pc1, pc2] = corr2(fullPts2, sub(red.points, unitRows), nUnits);
-                    let [nc1, nc2] = corr2(sub(full.rotation.nodes, retained),
-                                           sub(red.rotation.nodes, retained), retained.length);
+                    const reducedRows = retained.map((_, t) => t);
+                    let [pc1, pc2] = corr2(fullPts2, sub(red, red.points, unitRows), nUnits);
+                    let [nc1, nc2] = corr2(sub(full, full.rotation.nodes, retained),
+                                           sub(red, red.rotation.nodes, reducedRows), retained.length);
                     if (pc1 < 0) { pc1 = -pc1; nc1 = -nc1; }
                     if (pc2 < 0) { pc2 = -pc2; nc2 = -nc2; }
                     if (Math.min(pc1, pc2, nc1, nc2) < threshold) continue;
 
-                    // Dim-1 variance proportion over the FULL rotation spectrum
-                    // (= R's set$model$variance[1] = diag(var(points.rotated))/sum);
-                    // NOT model.variance, which is the 2-dim projected ratio.
-                    const ev = red.rotation.eigenvalues;
-                    let evSum = 0; for (let i = 0; i < ev.length; i++) evSum += ev[i];
-                    const vr1 = evSum > 0 ? ev[0] / evSum : 0;
+                    // Dim-1 share of the variance of the projected points across
+                    // ALL dimensions (= R's reduced.set$model$variance[1]). Not the
+                    // eigenvalue ratio: means and GMR rotations report a zero
+                    // eigenvalue for their first axis.
+                    const vr1 = red.model.variance[0];
                     // Prefer more codes removed; tie-break on higher dim-1 variance.
                     if (k > bestK || (k === bestK && vr1 > bestVar)) {
                         bestK = k; bestVar = vr1; bestRemoved = idxs.slice();

package/src/pipeline.js

@@ -133,11 +133,15 @@ export function sphereNorm(qe, networks, nUnits, nConnections) {
  * Subtract column means (center the network space).
  * Excludes all-zero rows from the mean calculation (zero-network exclusion).
  *
+ * @param {boolean} [shiftZeroRows=false]  Also subtract the mean from all-zero
+ *   rows, as rENA's center(exclude_zero_networks = TRUE) does -- the ONA
+ *   convention (ona::model). By default zero-network rows stay at zero, as in
+ *   rENA's ena.make.set().
  * @returns {{ centered: Float64Array, centerVec: Float64Array }}
- *   centered  — mean-subtracted networks (zero-network rows left at zero)
+ *   centered  — mean-subtracted networks
  *   centerVec — the column means used for centering (= R's rotation$center.vec)
  */
-export function center(qe, networks, nUnits, nConnections) {
+export function center(qe, networks, nUnits, nConnections, shiftZeroRows = false) {
     // Identify non-zero rows
     const active = [];
     for (let u = 0; u < nUnits; u++) {
@@ -160,7 +164,7 @@ export function center(qe, networks, nUnits, nConnections) {
     const activeSet = new Set(active);
     const centered  = new Float64Array(networks.length);
     for (let u = 0; u < nUnits; u++) {
-        if (!activeSet.has(u)) continue;          // leave zero-network row as zero
+        if (!shiftZeroRows && !activeSet.has(u)) continue;   // leave zero-network row as zero
         for (let c = 0; c < nConnections; c++) {
             centered[u * nConnections + c] = networks[u * nConnections + c] - means[c];
         }
@@ -301,14 +305,17 @@ export function project(centered, nUnits, nConnections, rotation, rotRows, rotCo
 /**
  * Compute code node positions via least-squares (LWS).
  *
+ * @param {boolean} [directed=false]  Use libqe's directed_node_positions (for
+ *   ordered n² networks), as rENA's optimize() does for ordered sets.
  * @returns {{ nodes: Float64Array, nodeRows: number, nodeCols: number,
  *             centroids: Float64Array|null }}
  *   nodes     — code positions in ENA space (= R's rotation$nodes)
  *   centroids — LWS unit centroid positions (= R's model$centroids), or null
  *               if libqe does not expose them
  */
-export function nodePositions(qe, networks, nUnits, nConnections, points, nDims) {
-    const r = qe.node_positions(networks, nUnits, nConnections, points, nUnits, nDims, nDims);
+export function nodePositions(qe, networks, nUnits, nConnections, points, nDims, directed = false) {
+    const solve = directed ? qe.directed_node_positions : qe.node_positions;
+    const r = solve(networks, nUnits, nConnections, points, nUnits, nDims, nDims);
     return {
         nodes:     new Float64Array(r.nodes.data),
         nodeRows:  r.nodes.rows,