medicine-wheel-relational-query 0.1.0

package/README.md

@@ -0,0 +1,59 @@
+# medicine-wheel-relational-query
+
+Query builder, graph traversal, and accountability audit for the Medicine Wheel relational web. Protocol-aware: respects ceremony boundaries and OCAP® compliance during traversal.
+
+## Install
+
+```bash
+npm install medicine-wheel-relational-query
+```
+
+## Modules
+
+### Query Builder
+Filter, sort, and paginate nodes and edges.
+
+```ts
+import { filterNodes, sortNodes, paginate } from 'medicine-wheel-relational-query';
+
+const elders = filterNodes(nodes, { type: 'human', direction: 'north' });
+const sorted = sortNodes(elders, { field: 'name', order: 'asc' });
+const page = paginate(sorted, { offset: 0, limit: 10 });
+```
+
+### Traversal
+Context-aware graph traversal with ceremony and OCAP boundaries.
+
+```ts
+import { traverse, shortestPath, neighborhood } from 'medicine-wheel-relational-query';
+
+const result = traverse('node-id', nodes, edges, relations, {
+  maxDepth: 3,
+  respectCeremonyBoundaries: true,
+  ocapOnly: true,
+});
+
+const path = shortestPath('from-id', 'to-id', nodes, edges);
+const neighbors = neighborhood('node-id', nodes, edges, 2);
+```
+
+### Accountability Audit
+Relational health metrics and OCAP® compliance reports.
+
+```ts
+import { auditAccountability, relationsNeedingAttention } from 'medicine-wheel-relational-query';
+
+const report = auditAccountability(nodes, edges, relations);
+console.log(report.averageWilsonAlignment);
+console.log(report.recommendations);
+
+const needsWork = relationsNeedingAttention(relations, 0.5);
+```
+
+## Peer dependency
+
+Requires `medicine-wheel-ontology-core` ^0.1.0.
+
+## License
+
+MIT

package/dist/audit.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Accountability Audit — relational health metrics and OCAP® compliance.
+ */
+import type { Relation, RelationalNode, RelationalEdge } from 'medicine-wheel-ontology-core';
+import type { AccountabilityReport } from './types.js';
+/** Generate an accountability report for a relational web */
+export declare function auditAccountability(nodes: RelationalNode[], edges: RelationalEdge[], relations: Relation[]): AccountabilityReport;
+/** Quick OCAP compliance check for a single relation */
+export declare function isOcapCompliant(relation: Relation): boolean;
+/** Identify relations that need attention (low alignment or non-compliant) */
+export declare function relationsNeedingAttention(relations: Relation[], wilsonThreshold?: number): Relation[];
+//# sourceMappingURL=audit.d.ts.map

package/dist/audit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"audit.d.ts","sourceRoot":"","sources":["../src/audit.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAEV,QAAQ,EACR,cAAc,EACd,cAAc,EACf,MAAM,8BAA8B,CAAC;AAKtC,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAEvD,6DAA6D;AAC7D,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,SAAS,EAAE,QAAQ,EAAE,GACpB,oBAAoB,CAwEtB;AAED,wDAAwD;AACxD,wBAAgB,eAAe,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAE3D;AAED,8EAA8E;AAC9E,wBAAgB,yBAAyB,CACvC,SAAS,EAAE,QAAQ,EAAE,EACrB,eAAe,GAAE,MAAY,GAC5B,QAAQ,EAAE,CAMZ"}

package/dist/audit.js

@@ -0,0 +1,80 @@
+import { aggregateWilsonAlignment, checkOcapCompliance, } from 'medicine-wheel-ontology-core';
+/** Generate an accountability report for a relational web */
+export function auditAccountability(nodes, edges, relations) {
+    const recommendations = [];
+    // OCAP compliance
+    let ocapCompliant = 0;
+    let ocapNonCompliant = 0;
+    for (const relation of relations) {
+        if (relation.ocap && checkOcapCompliance(relation.ocap).compliant) {
+            ocapCompliant++;
+        }
+        else {
+            ocapNonCompliant++;
+        }
+    }
+    // Wilson alignment
+    const averageWilsonAlignment = aggregateWilsonAlignment(relations);
+    // Direction coverage
+    const directionCoverage = { east: 0, south: 0, west: 0, north: 0 };
+    for (const node of nodes) {
+        if (node.direction) {
+            directionCoverage[node.direction]++;
+        }
+    }
+    // Ceremony honoring
+    const ceremoniedRelations = edges.filter(e => e.ceremony_honored).length;
+    const unceremoniedRelations = edges.filter(e => !e.ceremony_honored).length;
+    // Outstanding obligations (count total obligations across relations)
+    let obligationsOutstanding = 0;
+    for (const relation of relations) {
+        if (relation.obligations) {
+            obligationsOutstanding += relation.obligations.reduce((sum, o) => sum + o.obligations.length, 0);
+        }
+    }
+    // Recommendations
+    if (ocapNonCompliant > 0) {
+        recommendations.push(`${ocapNonCompliant} relation(s) lack full OCAP® compliance — review ownership, control, access, and possession flags`);
+    }
+    if (averageWilsonAlignment < 0.5) {
+        recommendations.push(`Wilson alignment is ${(averageWilsonAlignment * 100).toFixed(0)}% — strengthen respect, reciprocity, and responsibility`);
+    }
+    const emptyDirections = Object.entries(directionCoverage)
+        .filter(([, count]) => count === 0)
+        .map(([dir]) => dir);
+    if (emptyDirections.length > 0) {
+        recommendations.push(`No nodes in ${emptyDirections.join(', ')} direction(s) — consider expanding relational awareness`);
+    }
+    if (unceremoniedRelations > ceremoniedRelations && edges.length > 0) {
+        recommendations.push(`${unceremoniedRelations} of ${edges.length} relations lack ceremony — consider honoring these connections`);
+    }
+    if (obligationsOutstanding > 0) {
+        recommendations.push(`${obligationsOutstanding} obligation(s) outstanding — attend to relational responsibilities`);
+    }
+    return {
+        totalRelations: relations.length,
+        ocapCompliant,
+        ocapNonCompliant,
+        averageWilsonAlignment: Math.round(averageWilsonAlignment * 100) / 100,
+        directionCoverage,
+        ceremoniedRelations,
+        unceremoniedRelations,
+        obligationsOutstanding,
+        recommendations,
+    };
+}
+/** Quick OCAP compliance check for a single relation */
+export function isOcapCompliant(relation) {
+    return !!relation.ocap && checkOcapCompliance(relation.ocap).compliant;
+}
+/** Identify relations that need attention (low alignment or non-compliant) */
+export function relationsNeedingAttention(relations, wilsonThreshold = 0.5) {
+    return relations.filter(r => {
+        if (r.ocap && !checkOcapCompliance(r.ocap).compliant)
+            return true;
+        if (r.accountability && r.accountability.wilson_alignment < wilsonThreshold)
+            return true;
+        return false;
+    });
+}
+//# sourceMappingURL=audit.js.map

package/dist/audit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"audit.js","sourceRoot":"","sources":["../src/audit.ts"],"names":[],"mappings":"AASA,OAAO,EACL,wBAAwB,EACxB,mBAAmB,GACpB,MAAM,8BAA8B,CAAC;AAGtC,6DAA6D;AAC7D,MAAM,UAAU,mBAAmB,CACjC,KAAuB,EACvB,KAAuB,EACvB,SAAqB;IAErB,MAAM,eAAe,GAAa,EAAE,CAAC;IAErC,kBAAkB;IAClB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,IAAI,IAAI,mBAAmB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAClE,aAAa,EAAE,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,gBAAgB,EAAE,CAAC;QACrB,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,sBAAsB,GAAG,wBAAwB,CAAC,SAAS,CAAC,CAAC;IAEnE,qBAAqB;IACrB,MAAM,iBAAiB,GAAkC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAClG,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;QACtC,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,MAAM,mBAAmB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC;IACzE,MAAM,qBAAqB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,MAAM,CAAC;IAE5E,qEAAqE;IACrE,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;YACzB,sBAAsB,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACnG,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,IAAI,gBAAgB,GAAG,CAAC,EAAE,CAAC;QACzB,eAAe,CAAC,IAAI,CAAC,GAAG,gBAAgB,mGAAmG,CAAC,CAAC;IAC/I,CAAC;IAED,IAAI,sBAAsB,GAAG,GAAG,EAAE,CAAC;QACjC,eAAe,CAAC,IAAI,CAAC,uBAAuB,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,yDAAyD,CAAC,CAAC;IAClJ,CAAC;IAED,MAAM,eAAe,GAAI,MAAM,CAAC,OAAO,CAAC,iBAAiB,CAAoC;SAC1F,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC;SAClC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,eAAe,CAAC,IAAI,CAAC,eAAe,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,yDAAyD,CAAC,CAAC;IAC3H,CAAC;IAED,IAAI,qBAAqB,GAAG,mBAAmB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpE,eAAe,CAAC,IAAI,CAAC,GAAG,qBAAqB,OAAO,KAAK,CAAC,MAAM,gEAAgE,CAAC,CAAC;IACpI,CAAC;IAED,IAAI,sBAAsB,GAAG,CAAC,EAAE,CAAC;QAC/B,eAAe,CAAC,IAAI,CAAC,GAAG,sBAAsB,oEAAoE,CAAC,CAAC;IACtH,CAAC;IAED,OAAO;QACL,cAAc,EAAE,SAAS,CAAC,MAAM;QAChC,aAAa;QACb,gBAAgB;QAChB,sBAAsB,EAAE,IAAI,CAAC,KAAK,CAAC,sBAAsB,GAAG,GAAG,CAAC,GAAG,GAAG;QACtE,iBAAiB;QACjB,mBAAmB;QACnB,qBAAqB;QACrB,sBAAsB;QACtB,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,eAAe,CAAC,QAAkB;IAChD,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,IAAI,mBAAmB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC;AACzE,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,yBAAyB,CACvC,SAAqB,EACrB,kBAA0B,GAAG;IAE7B,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QAC1B,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAClE,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,cAAc,CAAC,gBAAgB,GAAG,eAAe;YAAE,OAAO,IAAI,CAAC;QACzF,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * medicine-wheel-relational-query
+ *
+ * Query builder, graph traversal, and accountability audit
+ * for the Medicine Wheel relational web.
+ */
+export type { NodeFilter, EdgeFilter, RelationFilter, SortField, SortOrder, QuerySort, QueryPagination, QueryOptions, QueryResult, TraversalDirection, TraversalOptions, TraversalPath, TraversalResult, AccountabilityReport, } from './types.js';
+export { filterNodes, filterEdges, sortNodes, paginate, filterByRelation, relationCounts, filterByMinRelations, } from './query.js';
+export { traverse, shortestPath, neighborhood, } from './traversal.js';
+export { auditAccountability, isOcapCompliant, relationsNeedingAttention, } from './audit.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,YAAY,EACV,UAAU,EACV,UAAU,EACV,cAAc,EACd,SAAS,EACT,SAAS,EACT,SAAS,EACT,eAAe,EACf,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,gBAAgB,EAChB,aAAa,EACb,eAAe,EACf,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAGpB,OAAO,EACL,WAAW,EACX,WAAW,EACX,SAAS,EACT,QAAQ,EACR,gBAAgB,EAChB,cAAc,EACd,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAGpB,OAAO,EACL,QAAQ,EACR,YAAY,EACZ,YAAY,GACb,MAAM,gBAAgB,CAAC;AAGxB,OAAO,EACL,mBAAmB,EACnB,eAAe,EACf,yBAAyB,GAC1B,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,13 @@
+/**
+ * medicine-wheel-relational-query
+ *
+ * Query builder, graph traversal, and accountability audit
+ * for the Medicine Wheel relational web.
+ */
+// Query builder
+export { filterNodes, filterEdges, sortNodes, paginate, filterByRelation, relationCounts, filterByMinRelations, } from './query.js';
+// Traversal
+export { traverse, shortestPath, neighborhood, } from './traversal.js';
+// Audit
+export { auditAccountability, isOcapCompliant, relationsNeedingAttention, } from './audit.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAoBH,gBAAgB;AAChB,OAAO,EACL,WAAW,EACX,WAAW,EACX,SAAS,EACT,QAAQ,EACR,gBAAgB,EAChB,cAAc,EACd,oBAAoB,GACrB,MAAM,YAAY,CAAC;AAEpB,YAAY;AACZ,OAAO,EACL,QAAQ,EACR,YAAY,EACZ,YAAY,GACb,MAAM,gBAAgB,CAAC;AAExB,QAAQ;AACR,OAAO,EACL,mBAAmB,EACnB,eAAe,EACf,yBAAyB,GAC1B,MAAM,YAAY,CAAC"}

package/dist/query.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Query Builder — fluent API for querying relational nodes and edges
+ * with Indigenous protocol awareness.
+ */
+import type { RelationalNode, RelationalEdge } from 'medicine-wheel-ontology-core';
+import type { NodeFilter, EdgeFilter, QuerySort, QueryPagination, QueryResult } from './types.js';
+/** Apply a NodeFilter to an array of nodes */
+export declare function filterNodes(nodes: RelationalNode[], filter: NodeFilter): RelationalNode[];
+/** Apply an EdgeFilter to an array of edges */
+export declare function filterEdges(edges: RelationalEdge[], filter: EdgeFilter): RelationalEdge[];
+/** Apply sorting to nodes */
+export declare function sortNodes(nodes: RelationalNode[], sort: QuerySort): RelationalNode[];
+/** Apply pagination */
+export declare function paginate<T>(items: T[], pagination: QueryPagination): QueryResult<T>;
+/** Filter nodes that have relations to a specific node */
+export declare function filterByRelation(nodes: RelationalNode[], edges: RelationalEdge[], targetNodeId: string): RelationalNode[];
+/** Count relations per node */
+export declare function relationCounts(nodes: RelationalNode[], edges: RelationalEdge[]): Map<string, number>;
+/** Filter nodes with minimum relation count */
+export declare function filterByMinRelations(nodes: RelationalNode[], edges: RelationalEdge[], minRelations: number): RelationalNode[];
+//# sourceMappingURL=query.d.ts.map

package/dist/query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AACnF,OAAO,KAAK,EACV,UAAU,EACV,UAAU,EACV,SAAS,EACT,eAAe,EACf,WAAW,EACZ,MAAM,YAAY,CAAC;AAEpB,8CAA8C;AAC9C,wBAAgB,WAAW,CACzB,KAAK,EAAE,cAAc,EAAE,EACvB,MAAM,EAAE,UAAU,GACjB,cAAc,EAAE,CA2BlB;AAED,+CAA+C;AAC/C,wBAAgB,WAAW,CACzB,KAAK,EAAE,cAAc,EAAE,EACvB,MAAM,EAAE,UAAU,GACjB,cAAc,EAAE,CAyBlB;AAED,6BAA6B;AAC7B,wBAAgB,SAAS,CACvB,KAAK,EAAE,cAAc,EAAE,EACvB,IAAI,EAAE,SAAS,GACd,cAAc,EAAE,CAsBlB;AAED,uBAAuB;AACvB,wBAAgB,QAAQ,CAAC,CAAC,EACxB,KAAK,EAAE,CAAC,EAAE,EACV,UAAU,EAAE,eAAe,GAC1B,WAAW,CAAC,CAAC,CAAC,CAWhB;AAED,0DAA0D;AAC1D,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,YAAY,EAAE,MAAM,GACnB,cAAc,EAAE,CAOlB;AAED,+BAA+B;AAC/B,wBAAgB,cAAc,CAC5B,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,GACtB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAUrB;AAED,+CAA+C;AAC/C,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,YAAY,EAAE,MAAM,GACnB,cAAc,EAAE,CAGlB"}

package/dist/query.js

@@ -0,0 +1,115 @@
+/** Apply a NodeFilter to an array of nodes */
+export function filterNodes(nodes, filter) {
+    let result = [...nodes];
+    if (filter.type) {
+        const types = Array.isArray(filter.type) ? filter.type : [filter.type];
+        result = result.filter(n => types.includes(n.type));
+    }
+    if (filter.direction) {
+        const dirs = Array.isArray(filter.direction) ? filter.direction : [filter.direction];
+        result = result.filter(n => n.direction && dirs.includes(n.direction));
+    }
+    if (filter.nameContains) {
+        const term = filter.nameContains.toLowerCase();
+        result = result.filter(n => n.name.toLowerCase().includes(term));
+    }
+    if (filter.createdAfter) {
+        result = result.filter(n => n.created_at >= filter.createdAfter);
+    }
+    if (filter.createdBefore) {
+        result = result.filter(n => n.created_at <= filter.createdBefore);
+    }
+    return result;
+}
+/** Apply an EdgeFilter to an array of edges */
+export function filterEdges(edges, filter) {
+    let result = [...edges];
+    if (filter.relationshipType) {
+        const types = Array.isArray(filter.relationshipType) ? filter.relationshipType : [filter.relationshipType];
+        result = result.filter(e => types.includes(e.relationship_type));
+    }
+    if (filter.minStrength !== undefined) {
+        result = result.filter(e => e.strength >= filter.minStrength);
+    }
+    if (filter.ceremonyHonored !== undefined) {
+        result = result.filter(e => e.ceremony_honored === filter.ceremonyHonored);
+    }
+    if (filter.fromNode) {
+        result = result.filter(e => e.from_id === filter.fromNode);
+    }
+    if (filter.toNode) {
+        result = result.filter(e => e.to_id === filter.toNode);
+    }
+    return result;
+}
+/** Apply sorting to nodes */
+export function sortNodes(nodes, sort) {
+    const sorted = [...nodes];
+    const multiplier = sort.order === 'desc' ? -1 : 1;
+    sorted.sort((a, b) => {
+        let aVal, bVal;
+        switch (sort.field) {
+            case 'name':
+                aVal = a.name;
+                bVal = b.name;
+                break;
+            case 'type':
+                aVal = a.type;
+                bVal = b.type;
+                break;
+            case 'direction':
+                aVal = a.direction ?? '';
+                bVal = b.direction ?? '';
+                break;
+            case 'updated_at':
+                aVal = a.updated_at;
+                bVal = b.updated_at;
+                break;
+            default:
+                aVal = a.created_at;
+                bVal = b.created_at;
+        }
+        return aVal.localeCompare(bVal) * multiplier;
+    });
+    return sorted;
+}
+/** Apply pagination */
+export function paginate(items, pagination) {
+    const total = items.length;
+    const paged = items.slice(pagination.offset, pagination.offset + pagination.limit);
+    return {
+        items: paged,
+        total,
+        offset: pagination.offset,
+        limit: pagination.limit,
+        hasMore: pagination.offset + pagination.limit < total,
+    };
+}
+/** Filter nodes that have relations to a specific node */
+export function filterByRelation(nodes, edges, targetNodeId) {
+    const connectedIds = new Set();
+    for (const edge of edges) {
+        if (edge.from_id === targetNodeId)
+            connectedIds.add(edge.to_id);
+        if (edge.to_id === targetNodeId)
+            connectedIds.add(edge.from_id);
+    }
+    return nodes.filter(n => connectedIds.has(n.id));
+}
+/** Count relations per node */
+export function relationCounts(nodes, edges) {
+    const counts = new Map();
+    for (const node of nodes)
+        counts.set(node.id, 0);
+    for (const edge of edges) {
+        counts.set(edge.from_id, (counts.get(edge.from_id) ?? 0) + 1);
+        counts.set(edge.to_id, (counts.get(edge.to_id) ?? 0) + 1);
+    }
+    return counts;
+}
+/** Filter nodes with minimum relation count */
+export function filterByMinRelations(nodes, edges, minRelations) {
+    const counts = relationCounts(nodes, edges);
+    return nodes.filter(n => (counts.get(n.id) ?? 0) >= minRelations);
+}
+//# sourceMappingURL=query.js.map

package/dist/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":"AAaA,8CAA8C;AAC9C,MAAM,UAAU,WAAW,CACzB,KAAuB,EACvB,MAAkB;IAElB,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAExB,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QAChB,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrF,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC;QAC/C,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACxB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,YAAa,CAAC,CAAC;IACpE,CAAC;IAED,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;QACzB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC,aAAc,CAAC,CAAC;IACrE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,WAAW,CACzB,KAAuB,EACvB,MAAkB;IAElB,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAExB,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;QAC3G,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACrC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,MAAM,CAAC,WAAY,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;QACzC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,KAAK,MAAM,CAAC,eAAe,CAAC,CAAC;IAC7E,CAAC;IAED,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC7D,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC;IACzD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6BAA6B;AAC7B,MAAM,UAAU,SAAS,CACvB,KAAuB,EACvB,IAAe;IAEf,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAElD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,IAAY,EAAE,IAAY,CAAC;QAC/B,QAAQ,IAAI,CAAC,KAAK,EAAE,CAAC;YACnB,KAAK,MAAM;gBACT,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;gBAAC,MAAM;YACtC,KAAK,MAAM;gBACT,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;gBAAC,MAAM;YACtC,KAAK,WAAW;gBACd,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC;gBAAC,MAAM;YAC5D,KAAK,YAAY;gBACf,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;gBAAC,MAAM;YAClD;gBACE,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;gBAAC,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC;QAC7C,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,uBAAuB;AACvB,MAAM,UAAU,QAAQ,CACtB,KAAU,EACV,UAA2B;IAE3B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAEnF,OAAO;QACL,KAAK,EAAE,KAAK;QACZ,KAAK;QACL,MAAM,EAAE,UAAU,CAAC,MAAM;QACzB,KAAK,EAAE,UAAU,CAAC,KAAK;QACvB,OAAO,EAAE,UAAU,CAAC,MAAM,GAAG,UAAU,CAAC,KAAK,GAAG,KAAK;KACtD,CAAC;AACJ,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,gBAAgB,CAC9B,KAAuB,EACvB,KAAuB,EACvB,YAAoB;IAEpB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,OAAO,KAAK,YAAY;YAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY;YAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,+BAA+B;AAC/B,MAAM,UAAU,cAAc,CAC5B,KAAuB,EACvB,KAAuB;IAEvB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,oBAAoB,CAClC,KAAuB,EACvB,KAAuB,EACvB,YAAoB;IAEpB,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC5C,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC;AACpE,CAAC"}

package/dist/traversal.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Graph Traversal — context-aware relationship traversal
+ * with ceremony boundary and OCAP® awareness.
+ */
+import type { RelationalNode, RelationalEdge, Relation } from 'medicine-wheel-ontology-core';
+import type { TraversalOptions, TraversalPath, TraversalResult } from './types.js';
+/** Traverse the relational web from a root node */
+export declare function traverse(rootId: string, nodes: RelationalNode[], edges: RelationalEdge[], relations: Relation[], opts?: Partial<TraversalOptions>): TraversalResult;
+/** Find shortest path between two nodes */
+export declare function shortestPath(fromId: string, toId: string, nodes: RelationalNode[], edges: RelationalEdge[]): TraversalPath | null;
+/** Find all nodes reachable within N hops */
+export declare function neighborhood(nodeId: string, nodes: RelationalNode[], edges: RelationalEdge[], maxDepth?: number): RelationalNode[];
+//# sourceMappingURL=traversal.d.ts.map

package/dist/traversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.d.ts","sourceRoot":"","sources":["../src/traversal.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAE7F,OAAO,KAAK,EACV,gBAAgB,EAChB,aAAa,EACb,eAAe,EAGhB,MAAM,YAAY,CAAC;AAiCpB,mDAAmD;AACnD,wBAAgB,QAAQ,CACtB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,SAAS,EAAE,QAAQ,EAAE,EACrB,IAAI,GAAE,OAAO,CAAC,gBAAgB,CAAM,GACnC,eAAe,CAoGjB;AAED,2CAA2C;AAC3C,wBAAgB,YAAY,CAC1B,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,GACtB,aAAa,GAAG,IAAI,CA4CtB;AAED,6CAA6C;AAC7C,wBAAgB,YAAY,CAC1B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,cAAc,EAAE,EACvB,KAAK,EAAE,cAAc,EAAE,EACvB,QAAQ,GAAE,MAAU,GACnB,cAAc,EAAE,CAMlB"}

package/dist/traversal.js

@@ -0,0 +1,148 @@
+import { checkOcapCompliance } from 'medicine-wheel-ontology-core';
+import { filterEdges, filterNodes } from './query.js';
+const DEFAULT_OPTIONS = {
+    maxDepth: 3,
+    direction: 'both',
+    respectCeremonyBoundaries: false,
+    ocapOnly: false,
+};
+/** Build an adjacency map from edges */
+function buildAdjacency(edges, direction) {
+    const adj = new Map();
+    for (const edge of edges) {
+        if (direction === 'outgoing' || direction === 'both') {
+            const list = adj.get(edge.from_id) ?? [];
+            list.push({ nodeId: edge.to_id, edge });
+            adj.set(edge.from_id, list);
+        }
+        if (direction === 'incoming' || direction === 'both') {
+            const list = adj.get(edge.to_id) ?? [];
+            list.push({ nodeId: edge.from_id, edge });
+            adj.set(edge.to_id, list);
+        }
+    }
+    return adj;
+}
+/** Traverse the relational web from a root node */
+export function traverse(rootId, nodes, edges, relations, opts = {}) {
+    const options = { ...DEFAULT_OPTIONS, ...opts };
+    // Pre-filter edges
+    let filteredEdges = edges;
+    if (options.edgeFilter) {
+        filteredEdges = filterEdges(edges, options.edgeFilter);
+    }
+    // OCAP filter: only follow edges whose relations are compliant
+    if (options.ocapOnly) {
+        const compliantRelIds = new Set(relations
+            .filter(r => r.ocap && checkOcapCompliance(r.ocap).compliant)
+            .map(r => r.id));
+        // Keep edges that match compliant relation IDs or have no relation mapping
+        filteredEdges = filteredEdges.filter(e => {
+            const relId = `${e.from_id}-${e.to_id}`;
+            const reverseId = `${e.to_id}-${e.from_id}`;
+            return compliantRelIds.has(relId) || compliantRelIds.has(reverseId) || !relations.some(r => r.id === relId || r.id === reverseId);
+        });
+    }
+    // Build adjacency
+    const adj = buildAdjacency(filteredEdges, options.direction);
+    // Node lookup
+    const nodeMap = new Map(nodes.map(n => [n.id, n]));
+    const rootNode = nodeMap.get(rootId);
+    if (!rootNode) {
+        return {
+            root: { id: rootId, type: 'knowledge', name: 'Unknown', created_at: '', updated_at: '' },
+            paths: [],
+            visitedNodes: new Set(),
+            maxDepthReached: false,
+        };
+    }
+    // BFS traversal
+    const paths = [];
+    const visited = new Set([rootId]);
+    let maxDepthReached = false;
+    const queue = [{ nodeId: rootId, path: [rootNode], edgePath: [], depth: 0 }];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (current.depth >= options.maxDepth) {
+            maxDepthReached = true;
+            continue;
+        }
+        const neighbors = adj.get(current.nodeId) ?? [];
+        for (const { nodeId, edge } of neighbors) {
+            if (visited.has(nodeId))
+                continue;
+            // Ceremony boundary check
+            if (options.respectCeremonyBoundaries && !edge.ceremony_honored) {
+                continue;
+            }
+            const node = nodeMap.get(nodeId);
+            if (!node)
+                continue;
+            // Node filter
+            if (options.nodeFilter) {
+                const filtered = filterNodes([node], options.nodeFilter);
+                if (filtered.length === 0)
+                    continue;
+            }
+            visited.add(nodeId);
+            const newPath = [...current.path, node];
+            const newEdgePath = [...current.edgePath, edge];
+            paths.push({
+                nodes: newPath,
+                edges: newEdgePath,
+                depth: current.depth + 1,
+            });
+            queue.push({
+                nodeId,
+                path: newPath,
+                edgePath: newEdgePath,
+                depth: current.depth + 1,
+            });
+        }
+    }
+    return { root: rootNode, paths, visitedNodes: visited, maxDepthReached };
+}
+/** Find shortest path between two nodes */
+export function shortestPath(fromId, toId, nodes, edges) {
+    const adj = buildAdjacency(edges, 'both');
+    const nodeMap = new Map(nodes.map(n => [n.id, n]));
+    const visited = new Set([fromId]);
+    const fromNode = nodeMap.get(fromId);
+    if (!fromNode)
+        return null;
+    const queue = [{ nodeId: fromId, path: [fromNode], edgePath: [] }];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (current.nodeId === toId) {
+            return {
+                nodes: current.path,
+                edges: current.edgePath,
+                depth: current.path.length - 1,
+            };
+        }
+        const neighbors = adj.get(current.nodeId) ?? [];
+        for (const { nodeId, edge } of neighbors) {
+            if (visited.has(nodeId))
+                continue;
+            visited.add(nodeId);
+            const node = nodeMap.get(nodeId);
+            if (!node)
+                continue;
+            queue.push({
+                nodeId,
+                path: [...current.path, node],
+                edgePath: [...current.edgePath, edge],
+            });
+        }
+    }
+    return null;
+}
+/** Find all nodes reachable within N hops */
+export function neighborhood(nodeId, nodes, edges, maxDepth = 2) {
+    const result = traverse(nodeId, nodes, edges, [], { maxDepth, direction: 'both' });
+    const nodeMap = new Map(nodes.map(n => [n.id, n]));
+    return [...result.visitedNodes]
+        .map(id => nodeMap.get(id))
+        .filter((n) => n !== undefined);
+}
+//# sourceMappingURL=traversal.js.map

package/dist/traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.js","sourceRoot":"","sources":["../src/traversal.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AAQnE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAEtD,MAAM,eAAe,GAAqB;IACxC,QAAQ,EAAE,CAAC;IACX,SAAS,EAAE,MAAM;IACjB,yBAAyB,EAAE,KAAK;IAChC,QAAQ,EAAE,KAAK;CAChB,CAAC;AAEF,wCAAwC;AACxC,SAAS,cAAc,CACrB,KAAuB,EACvB,SAA2C;IAE3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAA2D,CAAC;IAE/E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;YACxC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YAC1C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,QAAQ,CACtB,MAAc,EACd,KAAuB,EACvB,KAAuB,EACvB,SAAqB,EACrB,OAAkC,EAAE;IAEpC,MAAM,OAAO,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,IAAI,EAAE,CAAC;IAEhD,mBAAmB;IACnB,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,aAAa,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;IACzD,CAAC;IAED,+DAA+D;IAC/D,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,MAAM,eAAe,GAAG,IAAI,GAAG,CAC7B,SAAS;aACN,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC;aAC5D,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAClB,CAAC;QACF,2EAA2E;QAC3E,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YACvC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACxC,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5C,OAAO,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;QACpI,CAAC,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB;IAClB,MAAM,GAAG,GAAG,cAAc,CAAC,aAAa,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IAE7D,cAAc;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO;YACL,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAoB;YAC1G,KAAK,EAAE,EAAE;YACT,YAAY,EAAE,IAAI,GAAG,EAAE;YACvB,eAAe,EAAE,KAAK;SACvB,CAAC;IACJ,CAAC;IAED,gBAAgB;IAChB,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,IAAI,eAAe,GAAG,KAAK,CAAC;IAS5B,MAAM,KAAK,GAAgB,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAE1F,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE/B,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtC,eAAe,GAAG,IAAI,CAAC;YACvB,SAAS;QACX,CAAC;QAED,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAChD,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,SAAS,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAElC,0BAA0B;YAC1B,IAAI,OAAO,CAAC,yBAAyB,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAChE,SAAS;YACX,CAAC;YAED,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,cAAc;YACd,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACvB,MAAM,QAAQ,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;gBACzD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;YACtC,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,WAAW,GAAG,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAEhD,KAAK,CAAC,IAAI,CAAC;gBACT,KAAK,EAAE,OAAO;gBACd,KAAK,EAAE,WAAW;gBAClB,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;aACzB,CAAC,CAAC;YAEH,KAAK,CAAC,IAAI,CAAC;gBACT,MAAM;gBACN,IAAI,EAAE,OAAO;gBACb,QAAQ,EAAE,WAAW;gBACrB,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;aACzB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;AAC3E,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,YAAY,CAC1B,MAAc,EACd,IAAY,EACZ,KAAuB,EACvB,KAAuB;IAEvB,MAAM,GAAG,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAQ1C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAE3B,MAAM,KAAK,GAAgB,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;IAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE/B,IAAI,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC5B,OAAO;gBACL,KAAK,EAAE,OAAO,CAAC,IAAI;gBACnB,KAAK,EAAE,OAAO,CAAC,QAAQ;gBACvB,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;aAC/B,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAChD,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,SAAS,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,CAAC,IAAI,CAAC;gBACT,MAAM;gBACN,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC;gBAC7B,QAAQ,EAAE,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;aACtC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,YAAY,CAC1B,MAAc,EACd,KAAuB,EACvB,KAAuB,EACvB,WAAmB,CAAC;IAEpB,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,OAAO,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;SAC5B,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SAC1B,MAAM,CAAC,CAAC,CAAC,EAAuB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;AACzD,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,88 @@
+/**
+ * medicine-wheel-relational-query — types
+ *
+ * Query builder types for context-aware relational traversal
+ * with Indigenous protocol awareness.
+ */
+import type { DirectionName, NodeType, RelationalNode, RelationalEdge } from 'medicine-wheel-ontology-core';
+export interface NodeFilter {
+    type?: NodeType | NodeType[];
+    direction?: DirectionName | DirectionName[];
+    nameContains?: string;
+    hasRelationsTo?: string;
+    minRelations?: number;
+    createdAfter?: string;
+    createdBefore?: string;
+}
+export interface EdgeFilter {
+    relationshipType?: string | string[];
+    minStrength?: number;
+    ceremonyHonored?: boolean;
+    fromNode?: string;
+    toNode?: string;
+}
+export interface RelationFilter {
+    direction?: DirectionName;
+    ceremonied?: boolean;
+    ocapCompliant?: boolean;
+    minWilsonAlignment?: number;
+    hasObligations?: boolean;
+}
+export type SortField = 'name' | 'created_at' | 'updated_at' | 'type' | 'direction';
+export type SortOrder = 'asc' | 'desc';
+export interface QuerySort {
+    field: SortField;
+    order: SortOrder;
+}
+export interface QueryPagination {
+    offset: number;
+    limit: number;
+}
+export interface QueryOptions {
+    filter?: NodeFilter;
+    sort?: QuerySort;
+    pagination?: QueryPagination;
+    includeEdges?: boolean;
+    includeRelations?: boolean;
+}
+export interface QueryResult<T> {
+    items: T[];
+    total: number;
+    offset: number;
+    limit: number;
+    hasMore: boolean;
+}
+export type TraversalDirection = 'outgoing' | 'incoming' | 'both';
+export interface TraversalOptions {
+    maxDepth: number;
+    direction: TraversalDirection;
+    edgeFilter?: EdgeFilter;
+    nodeFilter?: NodeFilter;
+    /** Stop traversal at nodes without ceremony-honored edges */
+    respectCeremonyBoundaries?: boolean;
+    /** Only follow OCAP-compliant relations */
+    ocapOnly?: boolean;
+}
+export interface TraversalPath {
+    nodes: RelationalNode[];
+    edges: RelationalEdge[];
+    depth: number;
+}
+export interface TraversalResult {
+    root: RelationalNode;
+    paths: TraversalPath[];
+    visitedNodes: Set<string>;
+    maxDepthReached: boolean;
+}
+export interface AccountabilityReport {
+    totalRelations: number;
+    ocapCompliant: number;
+    ocapNonCompliant: number;
+    averageWilsonAlignment: number;
+    directionCoverage: Record<DirectionName, number>;
+    ceremoniedRelations: number;
+    unceremoniedRelations: number;
+    obligationsOutstanding: number;
+    recommendations: string[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EACV,aAAa,EACb,QAAQ,EAER,cAAc,EACd,cAAc,EAEf,MAAM,8BAA8B,CAAC;AAItC,MAAM,WAAW,UAAU;IACzB,IAAI,CAAC,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAAC;IAC7B,SAAS,CAAC,EAAE,aAAa,GAAG,aAAa,EAAE,CAAC;IAC5C,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,UAAU;IACzB,gBAAgB,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IACrC,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,cAAc;IAC7B,SAAS,CAAC,EAAE,aAAa,CAAC;IAC1B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAID,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,YAAY,GAAG,YAAY,GAAG,MAAM,GAAG,WAAW,CAAC;AACpF,MAAM,MAAM,SAAS,GAAG,KAAK,GAAG,MAAM,CAAC;AAEvC,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,SAAS,CAAC;IACjB,KAAK,EAAE,SAAS,CAAC;CAClB;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,UAAU,CAAC,EAAE,eAAe,CAAC;IAC7B,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,WAAW,CAAC,CAAC;IAC5B,KAAK,EAAE,CAAC,EAAE,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,OAAO,CAAC;CAClB;AAID,MAAM,MAAM,kBAAkB,GAAG,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;AAElE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,kBAAkB,CAAC;IAC9B,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,6DAA6D;IAC7D,yBAAyB,CAAC,EAAE,OAAO,CAAC;IACpC,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,cAAc,CAAC;IACrB,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B,eAAe,EAAE,OAAO,CAAC;CAC1B;AAID,MAAM,WAAW,oBAAoB;IACnC,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,iBAAiB,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;IACjD,mBAAmB,EAAE,MAAM,CAAC;IAC5B,qBAAqB,EAAE,MAAM,CAAC;IAC9B,sBAAsB,EAAE,MAAM,CAAC;IAC/B,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":""}

package/package.json

@@ -0,0 +1,39 @@
+{
+  "name": "medicine-wheel-relational-query",
+  "version": "0.1.0",
+  "description": "Query builder for relational webs with Indigenous protocol awareness — traversal, accountability, OCAP® compliance",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "clean": "rm -rf dist",
+    "prepublishOnly": "npm run clean && npm run build"
+  },
+  "keywords": [
+    "medicine-wheel",
+    "relational",
+    "query",
+    "indigenous",
+    "ocap",
+    "graph-traversal"
+  ],
+  "author": "jgwill",
+  "license": "MIT",
+  "dependencies": {
+    "medicine-wheel-ontology-core": "^0.1.0"
+  },
+  "devDependencies": {
+    "typescript": "^5.7.0"
+  }
+}