Interface GraphStore

All Known Implementing Classes:
InMemoryGraphStore, Neo4jGraphStore

public interface GraphStore
Vendor-neutral graph data access contract used by graph retrieval.

Implementations locate query-relevant seed nodes and expose outgoing neighbors. Traversal, cycle handling, path scoring, source fencing, and result ranking remain framework responsibilities. The built-in knowledge-tools adapter maps live KnowledgeTools triples onto this contract; it is not a separate graph.

Since:
0.13.0
  • Nested Class Summary

    Nested Classes
    Modifier and Type
    Interface
    Description
    static final record 
    A directed graph edge.
    static final record 
    An outgoing edge paired with its destination node.
    static final record 
    A graph node that can become a retrieved document.
    static final record 
    A scored query seed.
  • Method Summary

    Modifier and Type
    Method
    Description
    findSeeds(String query, int limit)
    Finds graph nodes that can seed traversal for a query.
    neighbors(String nodeId)
    Returns the outgoing edges and destination nodes for a node.
  • Method Details

    • findSeeds

      List<GraphStore.Seed> findSeeds(String query, int limit)
      Finds graph nodes that can seed traversal for a query.
      Parameters:
      query - query text, never null
      limit - maximum number of seeds requested
      Returns:
      seeds, never null
    • neighbors

      List<GraphStore.Neighbor> neighbors(String nodeId)
      Returns the outgoing edges and destination nodes for a node.
      Parameters:
      nodeId - expanded node identifier
      Returns:
      neighbors, never null