# Graph

> Browse 9 items tagged with Graph.

## Items

- [ArcadeDB](https://vectordb.ever.works/tr/items/arcadedb) — Open-source multi-model database with native vector embedding support alongside graph, document, and more.
- [VelesDB](https://vectordb.ever.works/tr/items/velesdb) — Embedded vector + graph + columnar database with HNSW indexing.
- [ruvector-graph-transformer](https://vectordb.ever.works/tr/items/ruvector-graph-transformer) — Unified graph transformer with proof-gated mutation substrate for verified graph-vector operations, featuring 8 modules and 186 tests.
- [ruvector-graph-transformer-node](https://vectordb.ever.works/tr/items/ruvector-graph-transformer-node) — Node.js NAPI-RS bindings for ruvector-graph-transformer with 22+ methods and 20 tests.
- [ruvector-graph-transformer-wasm](https://vectordb.ever.works/tr/items/ruvector-graph-transformer-wasm) — WASM bindings for browser-side graph transformers with proof verification.
- [ruvector-solver](https://vectordb.ever.works/tr/items/ruvector-solver) — Library providing sublinear-time solvers for large-scale math problems like PageRank, graph Laplacians, and AI attention using 8 algorithms including Neumann Series, Conjugate Gradient, Forward/Backward Push, and more. Optimized for scale with SIMD SpMV, fused kernels, and arena allocators; supports WASM and NAPI bindings.
- [ruvector-sparsifier](https://vectordb.ever.works/tr/items/ruvector-sparsifier) — Incremental graph sparsifier that compresses large graphs into a 'shadow graph' preserving key properties like connectivity, cuts, and flow. Uses random walks for importance scoring, spectral sampling, union-find backbone, and periodic auditing to maintain accuracy without full rebuilds.
- [GraphRAG](https://vectordb.ever.works/tr/items/graphrag-microsoft) — Microsoft's approach to RAG that uses knowledge graphs to enhance retrieval. GraphRAG builds structured representations of documents enabling better context understanding and multi-hop reasoning for complex queries.
- [HNSW (Hierarchical Navigable Small World)](https://vectordb.ever.works/tr/items/hnsw-hierarchical-navigable-small-world) — Graph-based algorithm for approximate nearest neighbor search that maintains multi-layer graph structures for efficient vector similarity search with logarithmic complexity, widely used in modern vector databases.

---

_Canonical page: https://vectordb.ever.works/tr/tags/graph_