modify the comments

Author: sama

cpp_easygraph/functions/centrality/eigenvector.cpp

@@ -160,11 +160,9 @@ CSRMatrix build_transpose_matrix(
 
     for (int i = 0; i < n; i++) {
         if (!has_connections[i]) {
-            // 为孤立节点添加小的自环权重
             matrix.indices.push_back(i);
             matrix.data.push_back(1.0e-4);
 
-            // 更新indptr
             for (int j = i + 1; j <= n; j++) {
                 matrix.indptr[j]++;
             }
@@ -313,10 +311,9 @@ py::object cpp_eigenvector_centrality(
 
         std::vector<bool> isolated_nodes(n, true);
         for (int i = 0; i < n; i++) {
-            if (A_transpose.indptr[i + 1] > A_transpose.indptr[i] + 1) { // +1 考虑我们可能添加的自环
+            if (A_transpose.indptr[i + 1] > A_transpose.indptr[i] + 1) { 
                 isolated_nodes[i] = false;
             } else if (A_transpose.indptr[i + 1] == A_transpose.indptr[i] + 1) {
-                // 检查是否是我们添加的自环
                 int idx = A_transpose.indptr[i];
                 if (A_transpose.indices[idx] == i && std::abs(A_transpose.data[idx] - 1.0e-4) < 1e-10) {
                     isolated_nodes[i] = true;

easygraph/functions/centrality/tests/test_eigenvector.py

@@ -16,7 +16,7 @@ def setUp(self):
             (4, 256),
             ((None, None), (None, None)),
         ]
-        # 注意：不要在测试集中包含空图
+
         self.test_graphs = []
         self.test_graphs.append(eg.classes.DiGraph(self.edges))
 
@@ -28,17 +28,16 @@ def setUp(self):
 
         self.weighted_graph = eg.Graph()
         self.weighted_graph.add_edges_from([(0, 1), (1, 2), (2, 3)])
-        # 根据test_closeness.py的风格设置权重
+
         for u, v, data in self.weighted_graph.edges:
             data["weight"] = 2.0
 
         self.disconnected_graph = eg.Graph()
         self.disconnected_graph.add_edges_from([(0, 1), (2, 3)])
 
-        # 孤立节点图
         self.isolated_node_graph = eg.Graph()
         self.isolated_node_graph.add_edges_from([(0, 1), (1, 2)])
-        self.isolated_node_graph.add_node(3)  # 添加孤立节点
+        self.isolated_node_graph.add_node(3)  
 
         self.single_node_graph = eg.Graph()
         self.single_node_graph.add_node(42)
@@ -47,19 +46,19 @@ def setUp(self):
         self.mixed_nodes_graph.add_edges_from([(1, 2), ("X", "Y"), ((1, 2), (3, 4))])
 
     def test_eigenvector(self):
-        # 测试非空图的特征向量中心性
+
         for G in self.test_graphs:
             result = eigenvector_centrality(G)
             self.assertIsInstance(result, dict)
             self.assertEqual(len(result), len(G))
-            # 验证所有值都是浮点数
+
             for v in result.values():
                 self.assertIsInstance(v, float)
 
     def test_simple_graph(self):
         result = eigenvector_centrality(self.simple_graph)
         self.assertEqual(len(result), len(self.simple_graph))
-        # 验证所有值都是浮点数
+
         for v in result.values():
             self.assertIsInstance(v, float)
 
@@ -72,25 +71,22 @@ def test_weighted_graph(self):
         self.assertEqual(len(result), len(self.weighted_graph))
 
     def test_disconnected_graph(self):
-        # 验证断开的图能正常计算中心性
+
         result = eigenvector_centrality(self.disconnected_graph)
         self.assertEqual(len(result), len(self.disconnected_graph))
 
     def test_isolated_nodes(self):
-        # 验证带有孤立节点的图能正常计算
+
         result = eigenvector_centrality(self.isolated_node_graph)
         self.assertEqual(len(result), len(self.isolated_node_graph))
-        # 验证孤立节点有合理的中心性值
         self.assertTrue(3 in result)
         self.assertGreaterEqual(result[3], 0)
 
     def test_single_node_graph(self):
-        # 验证单节点图会抛出适当的异常
         with self.assertRaises(EasyGraphPointlessConcept):
             eigenvector_centrality(self.single_node_graph)
 
     def test_mixed_node_types(self):
-        # 验证不同类型的节点都能正常处理
         result = eigenvector_centrality(self.mixed_nodes_graph)
         self.assertEqual(len(result), len(self.mixed_nodes_graph))
 
@@ -108,14 +104,12 @@ def test_nstart_parameter(self):
         self.assertEqual(len(result), len(self.simple_graph))
 
     def test_multigraph_raises(self):
-        # 验证多重图会抛出适当的异常
         G = eg.MultiGraph()
         G.add_edges_from([(0, 1), (0, 1)])
-        with self.assertRaises(EasyGraphNotImplemented):  # 修正这里的异常类型
+        with self.assertRaises(EasyGraphNotImplemented):  
             eigenvector_centrality(G)
 
     def test_empty_graph_raises(self):
-        # 验证空图会抛出适当的异常
         G = eg.Graph()
         with self.assertRaises(EasyGraphPointlessConcept):
             eigenvector_centrality(G)