From 465737efed6e0d4b81854d87a142762a9d631b98 Mon Sep 17 00:00:00 2001
From: yangdx <yangdx@znipower.com>
Date: Sun, 2 Mar 2025 17:32:25 +0800
Subject: [PATCH] Fix linting

---
 lightrag/api/routers/graph_routes.py | 7 ++++++-
 lightrag/kg/neo4j_impl.py            | 8 +++++---
 lightrag/kg/networkx_impl.py         | 2 +-
 3 files changed, 12 insertions(+), 5 deletions(-)

diff --git a/lightrag/api/routers/graph_routes.py b/lightrag/api/routers/graph_routes.py
index aa1803c2..e6f894a2 100644
--- a/lightrag/api/routers/graph_routes.py
+++ b/lightrag/api/routers/graph_routes.py
@@ -27,7 +27,12 @@ def create_graph_routes(rag, api_key: Optional[str] = None):
     @router.get("/graphs", dependencies=[Depends(optional_api_key)])
     async def get_knowledge_graph(label: str, max_depth: int = 3):
         """
-        Get knowledge graph for a specific label.
+        Retrieve a connected subgraph of nodes where the label includes the specified 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:
+            1. Label matching nodes take precedence
+            2. Followed by nodes directly connected to the matching nodes
+            3. Finally, the degree of the nodes
         Maximum number of nodes is limited to env MAX_GRAPH_NODES(default: 1000)
 
         Args:
diff --git a/lightrag/kg/neo4j_impl.py b/lightrag/kg/neo4j_impl.py
index 8052b1f7..dccee330 100644
--- a/lightrag/kg/neo4j_impl.py
+++ b/lightrag/kg/neo4j_impl.py
@@ -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
diff --git a/lightrag/kg/networkx_impl.py b/lightrag/kg/networkx_impl.py
index 92d36fa6..9601a35e 100644
--- a/lightrag/kg/networkx_impl.py
+++ b/lightrag/kg/networkx_impl.py
@@ -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