ComenzarEmpieza gratis

Graph RAG with filtering

For large and complex graphs, LLMs can sometimes struggle to accurately infer the most relevant nodes and relationships to build the Cypher query. Quite often, you will only need the LLM to be aware of a subset of the graph, and excluding particular node types will not only make it easier for the LLM to accurately create the Cypher query, but it will improve the query latency.

The graph database you've been working with is available as graph.

Este ejercicio forma parte del curso

Retrieval Augmented Generation (RAG) with LangChain

Ver curso

Instrucciones del ejercicio

  • Create a graph QA chain that queries the graph database while ignoring nodes with the "Concept" type; an llm has been defined for you, and you should set verbose=True.
  • Invoke the graph_qa_chain with the input provided.

Ejercicio interactivo práctico

Prueba este ejercicio y completa el código de muestra.

# Create the graph QA chain excluding Concept
graph_qa_chain = ____

# Invoke the chain with the input provided
result = ____({"query": "Who was Marie Curie married to?"})
print(f"Final answer: {result['result']}")
Editar y ejecutar código