@motebit/protocol 0.7.0 → 1.0.0

package/dist/graph.js

@@ -0,0 +1,95 @@
+/**
+ * Weighted directed graph parameterized by a semiring.
+ *
+ * The graph represents the agent network. Nodes are motebits.
+ * Edges carry semiring-valued weights (trust, cost, latency, or products thereof).
+ *
+ * Key insight: the same graph structure supports different queries by
+ * swapping the semiring used in traversal. The graph stores raw edge data;
+ * the semiring determines how to compose and compare paths.
+ */
+/**
+ * Immutable-ish weighted digraph. Nodes are string IDs (motebit_id).
+ * Edges are stored adjacency-list style for efficient traversal.
+ */
+export class WeightedDigraph {
+    semiring;
+    _adj = new Map();
+    _nodes = new Set();
+    constructor(semiring) {
+        this.semiring = semiring;
+    }
+    /** The semiring this graph operates over. */
+    get sr() {
+        return this.semiring;
+    }
+    addNode(id) {
+        this._nodes.add(id);
+        if (!this._adj.has(id))
+            this._adj.set(id, new Map());
+    }
+    /**
+     * Set an edge weight. If the edge already exists, the new weight
+     * is ⊕-combined with the existing weight (parallel edges merge).
+     */
+    addEdge(from, to, weight) {
+        this.addNode(from);
+        this.addNode(to);
+        const neighbors = this._adj.get(from);
+        const existing = neighbors.get(to);
+        neighbors.set(to, existing !== undefined ? this.semiring.add(existing, weight) : weight);
+    }
+    /** Set an edge weight, replacing any existing weight. */
+    setEdge(from, to, weight) {
+        this.addNode(from);
+        this.addNode(to);
+        this._adj.get(from).set(to, weight);
+    }
+    removeEdge(from, to) {
+        this._adj.get(from)?.delete(to);
+    }
+    removeNode(id) {
+        this._nodes.delete(id);
+        this._adj.delete(id);
+        for (const neighbors of this._adj.values()) {
+            neighbors.delete(id);
+        }
+    }
+    hasNode(id) {
+        return this._nodes.has(id);
+    }
+    hasEdge(from, to) {
+        return this._adj.get(from)?.has(to) ?? false;
+    }
+    /** Get edge weight, or semiring zero if no edge exists. */
+    getEdge(from, to) {
+        return this._adj.get(from)?.get(to) ?? this.semiring.zero;
+    }
+    nodes() {
+        return this._nodes;
+    }
+    nodeCount() {
+        return this._nodes.size;
+    }
+    /** Outgoing edges from a node. */
+    neighbors(id) {
+        return this._adj.get(id) ?? new Map();
+    }
+    /** All edges in the graph. */
+    edges() {
+        const result = [];
+        for (const [from, neighbors] of this._adj) {
+            for (const [to, weight] of neighbors) {
+                result.push({ from, to, weight });
+            }
+        }
+        return result;
+    }
+    edgeCount() {
+        let count = 0;
+        for (const neighbors of this._adj.values())
+            count += neighbors.size;
+        return count;
+    }
+}
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAUH;;;GAGG;AACH,MAAM,OAAO,eAAe;IAIG;IAHZ,IAAI,GAAG,IAAI,GAAG,EAA0B,CAAC;IACzC,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IAE5C,YAA6B,QAAqB;QAArB,aAAQ,GAAR,QAAQ,CAAa;IAAG,CAAC;IAEtD,6CAA6C;IAC7C,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,MAAS;QACzC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACjB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC3F,CAAC;IAED,yDAAyD;IACzD,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,MAAS;QACzC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED,UAAU,CAAC,IAAY,EAAE,EAAU;QACjC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,EAAU;QAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC;IAC/C,CAAC;IAED,2DAA2D;IAC3D,OAAO,CAAC,IAAY,EAAE,EAAU;QAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5D,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,kCAAkC;IAClC,SAAS,CAAC,EAAU;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;IACxC,CAAC;IAED,8BAA8B;IAC9B,KAAK;QACH,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS;QACP,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAAE,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC;QACpE,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}