Home

Dynamic Exploration Graph documentation

The Dynamic Exploration Graph (DEG) algorithm is a graphbased approximate nearest neighbor search technique. It offers performance comparable to HNSW while providing the added benefits of dynamic graph modification and robust exploration capabilities.

Contents:

• Tutorials
  • Installation
  • Quickstart
  • Building Graphs
  • Searching
  • FAQ & Caveats
• API
  • Overview Graphs
  • Graph Builder