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