Apply suggestion from @Copilot

Co-authored-by: Copilot <[email protected]>

Author: Nianle-Li

cpp_easygraph/functions/centrality/eigenvector.cpp

@@ -311,17 +311,13 @@ 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) { 
+            // A node is isolated if it has zero edges (no entries in its row)
+            if (A_transpose.indptr[i + 1] == A_transpose.indptr[i]) {
+                isolated_nodes[i] = true;
+            } else {
                 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;
-                } else {
-                    isolated_nodes[i] = false;
-                }
             }
-        }      
+        }
 
         std::vector<double> centrality;