gardel/lightrag
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added info logs when graph is truncated

Browse Source
This commit is contained in:
yangdx
2025-04-02 23:19:41 +08:00
parent 82c4baba70
commit 72132ee1d6
1 changed files with 13 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
lightrag/kg/networkx_impl.py
View File

@@ -287,6 +287,9 @@ class NetworkXStorage(BaseGraphStorage):
# Check if graph is truncated # Check if graph is truncated
if len(sorted_nodes) > max_nodes: if len(sorted_nodes) > max_nodes:
result.is_truncated = True result.is_truncated = True
logger.info(
f"Graph truncated: {len(sorted_nodes)} nodes found, limited to {max_nodes}"
)
limited_nodes = [node for node, _ in sorted_nodes[:max_nodes]] limited_nodes = [node for node, _ in sorted_nodes[:max_nodes]]
# Create subgraph with the highest degree nodes # Create subgraph with the highest degree nodes
@@ -317,6 +320,9 @@ class NetworkXStorage(BaseGraphStorage):
# and we've reached max_nodes, then the graph is truncated # and we've reached max_nodes, then the graph is truncated
if queue and len(bfs_nodes) >= max_nodes: if queue and len(bfs_nodes) >= max_nodes:
result.is_truncated = True result.is_truncated = True
logger.info(
f"Graph truncated: breadth-first search limited to {max_nodes} nodes"
)
# Create subgraph with BFS discovered nodes # Create subgraph with BFS discovered nodes
subgraph = graph.subgraph(bfs_nodes) subgraph = graph.subgraph(bfs_nodes)