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

Fix linting

Browse Source
This commit is contained in:
yangdx
2025-03-02 17:32:25 +08:00
parent 68bf02abb6
commit 465737efed
3 changed files with 12 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lightrag/kg/neo4j_impl.py
View File

@@ -475,7 +475,7 @@ class Neo4JStorage(BaseGraphStorage):
"""
Retrieve a connected subgraph of nodes where the label includes the specified `node_label`.
Maximum number of nodes is constrained by the environment variable `MAX_GRAPH_NODES` (default: 1000).
When reducing the number of nodes, the prioritization criteria are as follows:
When reducing the number of nodes, the prioritization criteria are as follows:
1. Label matching nodes take precedence (nodes containing the specified label string)
2. Followed by nodes directly connected to the matching nodes
3. Finally, the degree of the nodes
@@ -519,7 +519,9 @@ class Neo4JStorage(BaseGraphStorage):
"""
validate_result = await session.run(validate_query)
if not await validate_result.single():
logger.warning(f"No nodes containing '{label}' in their labels found!")
logger.warning(
f"No nodes containing '{label}' in their labels found!"
)
return result
# Main query uses partial matching
@@ -604,7 +606,7 @@ class Neo4JStorage(BaseGraphStorage):
result = {"nodes": [], "edges": []}
visited_nodes = set()
visited_edges = set()
async def traverse(current_label: str, current_depth: int):
if current_depth > max_depth:
return

2
lightrag/kg/networkx_impl.py
View File

@@ -237,7 +237,7 @@ class NetworkXStorage(BaseGraphStorage):
"""
Retrieve a connected subgraph of nodes where the label includes the specified `node_label`.
Maximum number of nodes is constrained by the environment variable `MAX_GRAPH_NODES` (default: 1000).
When reducing the number of nodes, the prioritization criteria are as follows:
When reducing the number of nodes, the prioritization criteria are as follows:
1. Label matching nodes take precedence
2. Followed by nodes directly connected to the matching nodes
3. Finally, the degree of the nodes