From 1935e4526ad8b8e19d7e41054dc7d5757679d078 Mon Sep 17 00:00:00 2001 From: CCM Date: Wed, 11 Jun 2025 03:43:30 +0800 Subject: [PATCH] docs: update graph_rag.mdx (#31548) **Description:** fix broken links --- docs/docs/integrations/retrievers/graph_rag.mdx | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/docs/docs/integrations/retrievers/graph_rag.mdx b/docs/docs/integrations/retrievers/graph_rag.mdx index ca70b00852d..3c7cee5d2de 100644 --- a/docs/docs/integrations/retrievers/graph_rag.mdx +++ b/docs/docs/integrations/retrievers/graph_rag.mdx @@ -31,20 +31,20 @@ retrieval over an **existing** vector store. ## Benefits -* [**Link based on existing metadata:**](https://datastax.github.io/graph-rag/get-started/) +* [**Link based on existing metadata:**](https://datastax.github.io/graph-rag/guide/get-started/) Use existing metadata fields without additional processing. Retrieve more from an existing vector store! -* [**Change links on demand:**](https://datastax.github.io/graph-rag/get-started/edges/) +* [**Change links on demand:**](https://datastax.github.io/graph-rag/guide/edges/) Edges can be specified on-the-fly, allowing different relationships to be traversed based on the question. -* [**Pluggable Traversal Strategies:**](https://datastax.github.io/graph-rag/get-started/strategies/) +* [**Pluggable Traversal Strategies:**](https://datastax.github.io/graph-rag/guide/strategies/) Use built-in traversal strategies like Eager or MMR, or define custom logic to select which nodes to explore. -* [**Broad compatibility:**](https://datastax.github.io/graph-rag/get-started/adapters/) +* [**Broad compatibility:**](https://datastax.github.io/graph-rag/guide/adapters/) Adapters are available for a variety of vector stores with support for additional stores easily added.