Files
modules/indexes-search/hyper-p2p-graph-index
Raven ScottandCursor 4b65b75327
Hyper-P2P Module Tests / unit-all (push) Failing after 1h13m56s
feat(pear,storage,network,indexes): manual API expansion batch
Runtime session touch/purge, target matrix filters, channel aliases,
storage snapshot, light-writer dropLast, noise session purge, trie bulk
insert, graph reachable/toJSON.

Co-authored-by: Cursor <[email protected]>
2026-05-21 02:28:21 -04:00
..
2026-05-20 23:36:32 -04:00
2026-05-20 22:56:32 -04:00
2026-05-21 00:07:44 -04:00
2026-05-20 21:57:50 -04:00
2026-05-20 21:57:50 -04:00
2026-05-20 22:56:32 -04:00

hyper-p2p-graph-index

Adjacency-list graph with neighbors and bounded BFS traversal.

Category: indexes-search

Protocol: graph-index/v1

When to use

Routing tables, social graphs, or dependency graphs explored locally by depth.

When not to use

Weighted shortest-path on large graphs (use a dedicated pathfinding module).

Quick start

const { HyperP2PGraphIndex } = require('hyper-p2p-graph-index')
const g = new HyperP2PGraphIndex()
g.addEdge('a', 'b')
console.log(g.bfs('a', 2))

Docs

Test

npm install && npm test