@graphty/algorithms 2.1.1 → 2.2.0

package/dist/src/indexed/isomorphism.js

@@ -0,0 +1,269 @@
+import { INVALID_INDEX } from "@graphty/graph-format";
+/**
+ * Count the distinct neighbours of `u` other than itself in one adjacency.
+ * @param view - The adjacency to read the row of
+ * @param u - The node
+ * @returns The simple degree, and whether `u` has a self-loop
+ */
+function simpleDegree(view, u) {
+    let degree = 0;
+    let loop = false;
+    let prev = INVALID_INDEX;
+    for (let a = view.rowPtr[u]; a < view.rowPtr[u + 1]; a++) {
+        const v = view.colIdx[a];
+        if (v === prev) {
+            continue;
+        }
+        prev = v;
+        if (v === u) {
+            loop = true;
+        }
+        else {
+            degree++;
+        }
+    }
+    return { degree, loop };
+}
+/**
+ * A per-node signature a node and its image must share: simple out-degree, simple in-degree
+ * (directed only) and the self-loop bit, packed in one number.
+ * @param s - The snapshot
+ * @returns One signature per node
+ */
+function signatures(s) {
+    const out = new Float64Array(s.nodeCount);
+    const rev = s.directed ? s.reverse() : null;
+    for (let u = 0; u < s.nodeCount; u++) {
+        const f = simpleDegree(s, u);
+        const inDegree = rev === null ? 0 : simpleDegree(rev, u).degree;
+        out[u] = (f.degree * 2 ** 26 + inDegree) * 2 + (f.loop ? 1 : 0);
+    }
+    return out;
+}
+/**
+ * The order the nodes of `s1` are mapped in: BFS over out- and in-arcs, one component after another
+ * from the lowest unvisited index. Every node after a component's first is adjacent to an earlier
+ * one (its parent), so its candidates are the neighbours of the parent's image.
+ * @param views - The forward adjacency, and on a directed snapshot the reverse one
+ * @param n - The node count
+ * @returns The order, each node's BFS parent (INVALID_INDEX for a component's first node) and
+ * which view the parent reached it through
+ */
+function matchOrder(views, n) {
+    const order = new Uint32Array(n);
+    const parent = new Uint32Array(n).fill(INVALID_INDEX);
+    const parentView = new Uint8Array(n);
+    const seen = new Uint8Array(n);
+    let tail = 0;
+    for (let r = 0; r < n; r++) {
+        if (seen[r] === 1) {
+            continue;
+        }
+        seen[r] = 1;
+        let head = tail;
+        order[tail++] = r;
+        while (head < tail) {
+            const u = order[head++];
+            for (let k = 0; k < views.length; k++) {
+                const { rowPtr, colIdx } = views[k];
+                for (let a = rowPtr[u]; a < rowPtr[u + 1]; a++) {
+                    const v = colIdx[a];
+                    if (seen[v] === 0) {
+                        seen[v] = 1;
+                        parent[v] = u;
+                        parentView[v] = k;
+                        order[tail++] = v;
+                    }
+                }
+            }
+        }
+    }
+    return { order, parent, parentView };
+}
+/**
+ * VF2-style depth-first search for isomorphisms from `s1` to `s2`.
+ * @param s1 - The first graph
+ * @param s2 - The second graph
+ * @param options - Node and edge match predicates
+ * @param found - Called with every isomorphism (a live array: copy it to keep it); returning true
+ * stops the search
+ */
+function search(s1, s2, options, found) {
+    const n = s1.nodeCount;
+    if (s1.directed !== s2.directed || n !== s2.nodeCount) {
+        return;
+    }
+    const sig1 = signatures(s1);
+    const sig2 = signatures(s2);
+    const sorted1 = sig1.slice().sort();
+    const sorted2 = sig2.slice().sort();
+    if (sorted1.some((x, i) => x !== sorted2[i])) {
+        return;
+    }
+    const views1 = s1.directed ? [s1, s1.reverse()] : [s1];
+    const views2 = s2.directed ? [s2, s2.reverse()] : [s2];
+    const { order, parent, parentView } = matchOrder(views1, n);
+    const core1 = new Uint32Array(n).fill(INVALID_INDEX);
+    const core2 = new Uint32Array(n).fill(INVALID_INDEX);
+    // Per view, the arc of s2 from the candidate to each neighbour, stamped with the search step.
+    const stamp = views2.map(() => new Uint32Array(n));
+    const arcTo = views2.map(() => new Uint32Array(n));
+    let step = 0;
+    const { nodeMatch, edgeMatch } = options;
+    const feasible = (u1, u2) => {
+        if (sig1[u1] !== sig2[u2] || (nodeMatch !== undefined && !nodeMatch(u1, u2, s1, s2))) {
+            return false;
+        }
+        // The signatures agree, so u1 has a self-loop exactly when u2 has one: offer the two loops.
+        if (edgeMatch !== undefined && sig1[u1] % 2 === 1) {
+            const loop1 = s1.arcToEdge[s1.findArc(u1, u1)];
+            const loop2 = s2.arcToEdge[s2.findArc(u2, u2)];
+            if (!edgeMatch(loop1, loop2, s1, s2)) {
+                return false;
+            }
+        }
+        step++;
+        for (let k = 0; k < views1.length; k++) {
+            const g1 = views1[k];
+            const g2 = views2[k];
+            let mapped2 = 0;
+            let prev = INVALID_INDEX;
+            for (let a = g2.rowPtr[u2]; a < g2.rowPtr[u2 + 1]; a++) {
+                const v = g2.colIdx[a];
+                if (v === prev || v === u2) {
+                    continue;
+                }
+                prev = v;
+                stamp[k][v] = step;
+                arcTo[k][v] = a;
+                if (core2[v] !== INVALID_INDEX) {
+                    mapped2++;
+                }
+            }
+            let mapped1 = 0;
+            prev = INVALID_INDEX;
+            for (let a = g1.rowPtr[u1]; a < g1.rowPtr[u1 + 1]; a++) {
+                const v = g1.colIdx[a];
+                if (v === prev || v === u1) {
+                    continue;
+                }
+                prev = v;
+                const image = core1[v];
+                if (image === INVALID_INDEX) {
+                    continue;
+                }
+                if (stamp[k][image] !== step) {
+                    return false;
+                }
+                mapped1++;
+                // An undirected edge is offered once: through the out-rows. A directed arc is
+                // offered through the view it is an out-arc or an in-arc of the new node in.
+                if (edgeMatch !== undefined && !edgeMatch(g1.arcToEdge[a], g2.arcToEdge[arcTo[k][image]], s1, s2)) {
+                    return false;
+                }
+            }
+            if (mapped1 !== mapped2) {
+                return false;
+            }
+        }
+        return true;
+    };
+    // Iterative DFS over depth; cursor[d] walks the candidate list of order[d].
+    const cursor = new Uint32Array(n + 1);
+    let depth = 0;
+    let stop = false;
+    const candidatesOf = (d) => {
+        const p = parent[order[d]];
+        if (p === INVALID_INDEX) {
+            return { view: null, from: 0, to: n };
+        }
+        const view = views2[parentView[order[d]]];
+        const image = core1[p];
+        return { view, from: view.rowPtr[image], to: view.rowPtr[image + 1] };
+    };
+    if (n === 0) {
+        found(core1);
+        return;
+    }
+    let range = candidatesOf(0);
+    cursor[0] = range.from;
+    while (!stop) {
+        const u1 = order[depth];
+        let advanced = false;
+        while (cursor[depth] < range.to) {
+            const c = cursor[depth]++;
+            const u2 = range.view === null ? c : range.view.colIdx[c];
+            // Parallel arcs repeat a candidate; take it once.
+            if (range.view !== null && c > range.from && range.view.colIdx[c - 1] === u2) {
+                continue;
+            }
+            if (core2[u2] !== INVALID_INDEX || !feasible(u1, u2)) {
+                continue;
+            }
+            core1[u1] = u2;
+            core2[u2] = u1;
+            if (depth === n - 1) {
+                stop = found(core1);
+                core1[u1] = INVALID_INDEX;
+                core2[u2] = INVALID_INDEX;
+                if (stop) {
+                    break;
+                }
+                continue;
+            }
+            depth++;
+            range = candidatesOf(depth);
+            cursor[depth] = range.from;
+            advanced = true;
+            break;
+        }
+        if (stop || advanced) {
+            continue;
+        }
+        // Exhausted: undo the mapping of the node below and resume its candidates.
+        if (depth === 0) {
+            return;
+        }
+        depth--;
+        const back = order[depth];
+        core2[core1[back]] = INVALID_INDEX;
+        core1[back] = INVALID_INDEX;
+        range = candidatesOf(depth);
+    }
+}
+/**
+ * Whether two snapshots are isomorphic, by a VF2-style search. Neighbourhoods are simple-graph:
+ * parallel arcs count once and a self-loop maps only to a self-loop. On a directed snapshot both
+ * arc directions are preserved.
+ * @param s1 - The first graph
+ * @param s2 - The second graph
+ * @param options - Node and edge match predicates
+ * @returns Whether an isomorphism exists and, when it does, the first one found
+ * @public
+ */
+export function isGraphIsomorphic(s1, s2, options = {}) {
+    let mapping = null;
+    search(s1, s2, options, (m) => {
+        mapping = m.slice();
+        return true;
+    });
+    return { isomorphic: mapping !== null, mapping };
+}
+/**
+ * Every isomorphism from `s1` to `s2`, with the neighbourhood rules of {@link isGraphIsomorphic}.
+ * Two empty graphs have one, the empty mapping.
+ * @param s1 - The first graph
+ * @param s2 - The second graph
+ * @param options - Node and edge match predicates
+ * @returns One array per isomorphism: the image in `s2` of every node of `s1`
+ * @public
+ */
+export function findAllIsomorphisms(s1, s2, options = {}) {
+    const all = [];
+    search(s1, s2, options, (m) => {
+        all.push(m.slice());
+        return false;
+    });
+    return all;
+}
+//# sourceMappingURL=isomorphism.js.map

package/dist/src/indexed/isomorphism.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isomorphism.js","sourceRoot":"","sources":["../../../src/indexed/isomorphism.ts"],"names":[],"mappings":"AAAA,OAAO,EAA0C,aAAa,EAAY,MAAM,uBAAuB,CAAC;AAuBxG;;;;;GAKG;AACH,SAAS,YAAY,CAAC,IAAmB,EAAE,CAAS;IAChD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,IAAI,IAAI,GAAG,aAAa,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QACD,IAAI,GAAG,CAAC,CAAC;QACT,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,IAAI,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACJ,MAAM,EAAE,CAAC;QACb,CAAC;IACL,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,CAAgB;IAChC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QAChE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,UAAU,CAAC,KAA+B,EAAE,CAAS;IAC1D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACtD,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAChB,SAAS;QACb,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,IAAI,GAAG,IAAI,EAAE,CAAC;YACjB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBACpB,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBAChB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACZ,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACd,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBAClB,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;oBACtB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,MAAM,CACX,EAAiB,EACjB,EAAiB,EACjB,OAA2B,EAC3B,KAAgC;IAEhC,MAAM,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC;IACvB,IAAI,EAAE,CAAC,QAAQ,KAAK,EAAE,CAAC,QAAQ,IAAI,CAAC,KAAK,EAAE,CAAC,SAAS,EAAE,CAAC;QACpD,OAAO;IACX,CAAC;IACD,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;IACpC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,OAAO;IACX,CAAC;IACD,MAAM,MAAM,GAAoB,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxE,MAAM,MAAM,GAAoB,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACrD,8FAA8F;IAC9F,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IAEzC,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,EAAU,EAAW,EAAE;QACjD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC;YACnF,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,4FAA4F;QAC5F,IAAI,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/C,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBACnC,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,IAAI,EAAE,CAAC;QACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,IAAI,GAAG,aAAa,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;oBACzB,SAAS;gBACb,CAAC;gBACD,IAAI,GAAG,CAAC,CAAC;gBACT,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACnB,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAChB,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,CAAC;oBAC7B,OAAO,EAAE,CAAC;gBACd,CAAC;YACL,CAAC;YACD,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,GAAG,aAAa,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;oBACzB,SAAS;gBACb,CAAC;gBACD,IAAI,GAAG,CAAC,CAAC;gBACT,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,KAAK,KAAK,aAAa,EAAE,CAAC;oBAC1B,SAAS;gBACb,CAAC;gBACD,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;oBAC3B,OAAO,KAAK,CAAC;gBACjB,CAAC;gBACD,OAAO,EAAE,CAAC;gBACV,8EAA8E;gBAC9E,6EAA6E;gBAC7E,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;oBAChG,OAAO,KAAK,CAAC;gBACjB,CAAC;YACL,CAAC;YACD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF,4EAA4E;IAC5E,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,MAAM,YAAY,GAAG,CAAC,CAAS,EAA4D,EAAE;QACzF,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,aAAa,EAAE,CAAC;YACtB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QAC1C,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;IAC1E,CAAC,CAAC;IACF,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,KAAK,CAAC,KAAK,CAAC,CAAC;QACb,OAAO;IACX,CAAC;IACD,IAAI,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;IACvB,OAAO,CAAC,IAAI,EAAE,CAAC;QACX,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,OAAO,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1D,kDAAkD;YAClD,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;gBAC3E,SAAS;YACb,CAAC;YACD,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,aAAa,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;gBACnD,SAAS;YACb,CAAC;YACD,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACf,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACf,IAAI,KAAK,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpB,KAAK,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC;gBAC1B,KAAK,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC;gBAC1B,IAAI,IAAI,EAAE,CAAC;oBACP,MAAM;gBACV,CAAC;gBACD,SAAS;YACb,CAAC;YACD,KAAK,EAAE,CAAC;YACR,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;YAC3B,QAAQ,GAAG,IAAI,CAAC;YAChB,MAAM;QACV,CAAC;QACD,IAAI,IAAI,IAAI,QAAQ,EAAE,CAAC;YACnB,SAAS;QACb,CAAC;QACD,2EAA2E;QAC3E,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACd,OAAO;QACX,CAAC;QACD,KAAK,EAAE,CAAC;QACR,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,aAAa,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC;QAC5B,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC7B,EAAiB,EACjB,EAAiB,EACjB,UAA8B,EAAE;IAEhC,IAAI,OAAO,GAAe,IAAI,CAAC;IAC/B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE;QAC1B,OAAO,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,UAAU,EAAE,OAAO,KAAK,IAAI,EAAE,OAAO,EAAE,CAAC;AACrD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAiB,EAAE,EAAiB,EAAE,UAA8B,EAAE;IACtG,MAAM,GAAG,GAAU,EAAE,CAAC;IACtB,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE;QAC1B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACpB,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACf,CAAC"}

package/dist/src/indexed/label-propagation.d.ts

@@ -0,0 +1,134 @@
+import { type AdjacencyView, type GraphSnapshot, type NumericVector, type U32 } from "@graphty/graph-format";
+import { type LabelResult } from "./components.js";
+/** Options of the index-based label propagation. @public */
+export interface LabelPropagationOptions {
+    /** Work cap, in node visits per node (full-sweep equivalents); default 100. */
+    readonly maxIterations?: number | undefined;
+    /** Seed of the visit order and of the tie draws; default 42. */
+    readonly randomSeed?: number | undefined;
+    /** Sum arc weights (true, the default) or count each distinct neighbour once (false). */
+    readonly weighted?: boolean | undefined;
+}
+/** Result of the index-based label propagation. @public */
+export interface LabelPropagationResult extends LabelResult {
+    /** Node visits divided by the node count, rounded up. */
+    readonly iterations: number;
+    /**
+     * True when the work queue emptied before the visit cap, which leaves every node's label
+     * dominant among its neighbours. False only says the cap was reached with nodes still queued:
+     * the labels may already be dominant.
+     */
+    readonly converged: boolean;
+}
+/**
+ * mulberry32: 32-bit state, output in [0, 1). The exact sequence is part of the result contract
+ * (design section 2.4): changing it changes every partition.
+ * @param seed - Generator seed; only its low 32 bits are used
+ * @returns The generator
+ */
+export declare function mulberry32(seed: number): () => number;
+/**
+ * The per-arc weights of `view` that the votes use: the snapshot's exact f64 weights when it keeps
+ * them (graph-format keeps a role-"weight" f64 edge column whenever some weight is not f32-exact),
+ * gathered through arcToEdge; otherwise the view's own f32 arc array. Voting on the f32 values would
+ * turn 1 and 1 + 1e-9 into a tie, 1e39 into Infinity and 1e-50 into 0.
+ * @param view - The forward snapshot or its reverse view
+ * @param exact - The exact per-edge weights, or null when the f32 arc array is exact
+ * @returns The arc weights, or null when every arc weighs 1
+ */
+export declare function arcWeightsOf(view: AdjacencyView, exact: Float64Array | null): NumericVector | null;
+/**
+ * The exact per-edge weights of `s`: its role-"weight" f64 edge column when it keeps one, else null
+ * (the f32 arc array is then exact).
+ * @param s - The snapshot
+ * @returns The exact weights per logical edge, or null
+ */
+export declare function exactEdgeWeights(s: GraphSnapshot): Float64Array | null;
+/**
+ * Community detection by fast label propagation (FLPA; Traag and Subelj, Sci. Rep. 13:2701, 2023,
+ * Algorithm 3), the queue-driven form of Raghavan, Albert and Kumara's asynchronous label
+ * propagation.
+ *
+ * Every node starts in its own community. Nodes are visited from a queue that starts as a seeded
+ * shuffle of all of them; a visited node adopts the label with the largest summed arc weight among
+ * its neighbours, drawing uniformly at random among tied labels (its current label included, with
+ * no priority). When its label changes, every neighbour holding a different label is queued again.
+ * The run ends when the queue empties -- then every node's label is dominant among its neighbours
+ * and `converged` is true -- or after `maxIterations * nodeCount` node visits.
+ *
+ * Conventions: self-loops are skipped; parallel arcs are summed; on a directed snapshot a node's
+ * neighbours are its out-arcs AND its in-arcs, so a reciprocal pair counts twice. With
+ * `weighted: false` each distinct neighbour votes once. A negative, NaN or infinite weight throws.
+ * Votes use the exact f64 weights when the snapshot keeps them (as `toSnapshot` does for a legacy
+ * graph whose weights are not all f32-exact), so a weight rounded in the f32 arc array never
+ * decides a vote.
+ *
+ * One `randomSeed` gives one result, bit for bit. The partitions differ from the legacy
+ * `labelPropagation` for the same seed: the random stream and the stop rule are different
+ * (design `design/algorithms/label-propagation-indexed-port-design.md`, section 3).
+ * @param s - Any snapshot
+ * @param options - Work cap, seed and weighting
+ * @returns The partition, the full-sweep equivalents run, and whether the work queue emptied
+ * @public
+ */
+export declare function labelPropagation(s: GraphSnapshot, options?: LabelPropagationOptions): LabelPropagationResult;
+/**
+ * Semi-supervised label propagation: the FLPA kernel of {@link labelPropagation} with some nodes
+ * held at a given label (the `initial` / `fixed` inputs of igraph's `community_label_propagation`).
+ *
+ * A seeded node keeps its label for the whole run and is never visited; every other node starts in
+ * its own community and moves as in `labelPropagation`. Seeds that share a label share one community
+ * from the start, and seeds with different labels are never merged, so in the result two seeds
+ * carry the same label exactly when their seed labels are equal. The result is renumbered to
+ * `0..count-1` in first-seen node order like every other partition here, so a seed label's VALUE is
+ * not kept: read a seed's community through `labels[seedNode]`. With no seed at all this is
+ * `labelPropagation` with the same seed and options, bit for bit.
+ *
+ * `converged` is true when the work queue emptied, or when `maxIterations` is 0 and the starting
+ * labels already are dominant: every unseeded node's label is dominant among its neighbours.
+ * Seeded nodes are not held to that.
+ * @param s - Any snapshot
+ * @param seeds - One entry per node: its fixed label, any value but `INVALID_INDEX`, or
+ *   `INVALID_INDEX` for a node free to move
+ * @param options - Work cap, seed of the visit order and weighting
+ * @returns The partition, the full-sweep equivalents run, and whether the work queue emptied
+ * @throws RangeError when `seeds` is not one entry per node, or for a bad option or weight
+ * @public
+ */
+export declare function labelPropagationSemiSupervised(s: GraphSnapshot, seeds: U32, options?: LabelPropagationOptions): LabelPropagationResult;
+/** Options of the synchronous label propagation. @public */
+export interface SynchronousLabelPropagationOptions {
+    /** Cap on synchronous passes over every node; default 100. */
+    readonly maxIterations?: number | undefined;
+    /** Sum arc weights (true, the default) or count each distinct neighbour once (false). */
+    readonly weighted?: boolean | undefined;
+}
+/**
+ * Label propagation in synchronous passes: every node reads its neighbours' labels from the
+ * previous pass, and all nodes move at once. Deterministic, with no random stream.
+ *
+ * A node keeps its label when that label is dominant among its neighbours; otherwise it takes the
+ * LOWEST label with the largest summed vote. Synchronous updates alone make two neighbours trade
+ * labels for ever (on a single edge a-b, a takes b's label while b takes a's), so passes alternate
+ * a swap guard: an even pass (the first is pass 0) lets a node move only to a higher label, an odd
+ * pass only to a lower one (the up/down rule of cuGraph's Louvain move phase). The run stops after
+ * two passes in a row with no move, one up and one down -- then every node's label is dominant and
+ * `converged` is true -- or after `maxIterations` passes.
+ *
+ * The guard stops the single-edge swap but not every cycle: on some weighted graphs a node climbs to
+ * a higher label on each up pass and falls back on each down pass. When a pass returns the labels
+ * of two passes before, the run can only repeat itself, so it stops there with `converged` false;
+ * the result is then the same for any larger `maxIterations`. Longer cycles run to the cap.
+ *
+ * This is what the legacy `labelPropagationAsync` does, despite its name, with the swap guard it
+ * lacks and the tie rule applied to the finished tally rather than to a running one. Conventions
+ * match {@link labelPropagation}: self-loops are skipped, parallel arcs summed, a directed snapshot
+ * reads out- and in-neighbours, weights are the exact f64 ones when the snapshot keeps them, and a
+ * negative, NaN or infinite weight throws.
+ * @param s - Any snapshot
+ * @param options - Pass cap and weighting
+ * @returns The partition, the passes run, and whether every label ended dominant
+ * @public
+ */
+export declare function labelPropagationSynchronous(s: GraphSnapshot, options?: SynchronousLabelPropagationOptions): LabelPropagationResult;
+//# sourceMappingURL=label-propagation.d.ts.map

package/dist/src/indexed/label-propagation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"label-propagation.d.ts","sourceRoot":"","sources":["../../../src/indexed/label-propagation.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,KAAK,aAAa,EAClB,KAAK,aAAa,EAElB,KAAK,aAAa,EAElB,KAAK,GAAG,EACX,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EAAE,KAAK,WAAW,EAAc,MAAM,iBAAiB,CAAC;AAE/D,4DAA4D;AAC5D,MAAM,WAAW,uBAAuB;IACpC,+EAA+E;IAC/E,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,gEAAgE;IAChE,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3C;AAED,2DAA2D;AAC3D,MAAM,WAAW,sBAAuB,SAAQ,WAAW;IACvD,yDAAyD;IACzD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;CAC/B;AAKD;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,MAAM,CAQrD;AA0CD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,YAAY,GAAG,IAAI,GAAG,aAAa,GAAG,IAAI,CASlG;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,aAAa,GAAG,YAAY,GAAG,IAAI,CAGtE;AAwPD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,GAAE,uBAA4B,GAAG,sBAAsB,CAkBhH;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,8BAA8B,CAC1C,CAAC,EAAE,aAAa,EAChB,KAAK,EAAE,GAAG,EACV,OAAO,GAAE,uBAA4B,GACtC,sBAAsB,CAmCxB;AAED,4DAA4D;AAC5D,MAAM,WAAW,kCAAkC;IAC/C,8DAA8D;IAC9D,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,yFAAyF;IACzF,QAAQ,CAAC,QAAQ,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3C;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,2BAA2B,CACvC,CAAC,EAAE,aAAa,EAChB,OAAO,GAAE,kCAAuC,GACjD,sBAAsB,CAgDxB"}