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-04-25 09:43:18 +08:00
parent c620f9c4f2
commit bd11bcae32
1 changed files with 6 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
lightrag/kg/networkx_impl.py
View File

@@ -268,9 +268,13 @@ class NetworkXStorage(BaseGraphStorage):
# Filter out already visited neighbors # Filter out already visited neighbors
unvisited_neighbors = [n for n in neighbors if n not in visited] unvisited_neighbors = [n for n in neighbors if n not in visited]
# Get the degree of each neighbor node # Get the degree of each neighbor node
neighbor_degrees = [(n, graph.degree(n)) for n in unvisited_neighbors] neighbor_degrees = [
(n, graph.degree(n)) for n in unvisited_neighbors
]
# Sort neighbors by degree in descending order # Sort neighbors by degree in descending order
sorted_neighbors = sorted(neighbor_degrees, key=lambda x: x[1], reverse=True) sorted_neighbors = sorted(
neighbor_degrees, key=lambda x: x[1], reverse=True
)
# Add sorted neighbors to the queue # Add sorted neighbors to the queue
queue.extend([(n, depth + 1) for n, _ in sorted_neighbors]) queue.extend([(n, depth + 1) for n, _ in sorted_neighbors])