mirror of
https://github.com/NVIDIA/dgx-spark-playbooks.git
synced 2026-04-24 02:43:55 +00:00
7742a9f0de
- Extract ALL edges from graph traversal paths, not just endpoints - Add depth field (edge position in path: 0, 1, 2...) - Add pathLength field (total edges in path) - Use numeric index iteration for AQL compatibility - Apply depth penalty to edge scoring (earlier edges weighted higher) - Enable visualization of knowledge chains in graph queries - Increase topK default to 40 for richer multi-hop context This allows Traditional Graph to show how information is connected across multiple hops in the knowledge graph, similar to GraphRAG. 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <noreply@anthropic.com> |
||
|---|---|---|
| .. | ||
| arangodb-loader.ts | ||
| arangodb.ts | ||
| backend-service.ts | ||
| client-init.ts | ||
| embeddings.ts | ||
| graph-db-service.ts | ||
| graph-db-util.ts | ||
| langchain-service.ts | ||
| llm-service.ts | ||
| neo4j.ts | ||
| pinecone.ts | ||
| qdrant.ts | ||
| query-logger.ts | ||
| rag.ts | ||
| remote-backend.ts | ||
| text-processor.ts | ||
| utils.ts | ||