Added ignore tags to false positives

Author: Markus28

polygraph/datasets/lobster.py

@@ -22,7 +22,7 @@ def is_lobster_graph(graph: nx.Graph) -> bool:
         leaves = [n for n, d in graph.degree() if d == 1]   # pyright: ignore
         graph.remove_nodes_from(leaves)
 
-        num_nodes = len(graph.nodes())
+        num_nodes = len(graph.nodes())   # pyright: ignore
         num_degree_one = [d for n, d in graph.degree() if d == 1]   # pyright: ignore
         num_degree_two = [d for n, d in graph.degree() if d == 2]   # pyright: ignore
 

polygraph/datasets/planar.py

@@ -37,7 +37,7 @@ def __init__(
         memmap: bool = False,
         show_generation_progress: bool = False,
     ):
-        config_hash: str = joblib.hash(
+        config_hash: str = joblib.hash(          # pyright: ignore  
             (num_graphs, n_nodes, seed, split), hash_name="md5"
         )
         self._rng = np.random.default_rng(

polygraph/metrics/base/polygraphscore.py

@@ -373,12 +373,12 @@ def compute(
         samples = []
         for _ in range(num_samples):
             ref_idx = rng.choice(
-                self._reference_descriptions.shape[0],
+                self._reference_descriptions.shape[0],   # pyright: ignore
                 size=subsample_size,
                 replace=False,
             )
             gen_idx = rng.choice(
-                descriptions.shape[0], size=subsample_size, replace=False
+                descriptions.shape[0], size=subsample_size, replace=False   # pyright: ignore
             )
             samples.append(
                 _descriptions_to_classifier_metric(

polygraph/utils/graph_descriptors.py

@@ -153,7 +153,7 @@ def __call__(self, graphs: Iterable[nx.Graph]) -> csr_array:
         ptr[1:] = np.cumsum([len(idx) for idx in index]).astype(np.int32)
         result = csr_array(
             (np.concatenate(data), np.concatenate(index), ptr),
-            (len(graphs), 100_000),
+            (len(hists), 100_000),
         )
         return result
 
@@ -223,6 +223,7 @@ def __init__(
 
     def __call__(self, graphs: Iterable[nx.Graph]):
         # Check if any graph has a self-loop
+        graphs = list(graphs)
         self_loops = [list(nx.selfloop_edges(g)) for g in graphs]
         if any(len(loops) > 0 for loops in self_loops):
             warnings.warn(
@@ -389,7 +390,7 @@ def __call__(self, graphs: Iterable[nx.Graph]) -> np.ndarray:
                 self._device
             )
 
-        batch = Batch.from_data_list(pyg_graphs).to(self._device)
+        batch = Batch.from_data_list(pyg_graphs).to(self._device)   # pyright: ignore
 
         graph_embeds = self._feat_fn(
             feats, batch.edge_index, batch.batch, edge_attr=edge_attr

polygraph/utils/kernels.py

@@ -208,7 +208,7 @@ def pre_gram_block(self, x: MatrixLike, y: MatrixLike) -> np.ndarray:
             comparison = np.expand_dims(comparison, -1)
 
         comparison = np.exp(-self.lbd * comparison)
-        assert comparison.shape[:2] == (x.shape[0], y.shape[0])
+        assert comparison.shape[:2] == (x.shape[0], y.shape[0])     # pyright: ignore
         return comparison
 
 
@@ -264,7 +264,7 @@ def pre_gram_block(self, x: MatrixLike, y: MatrixLike) -> np.ndarray:
             comparison = np.expand_dims(comparison, -1)
 
         comparison = np.exp(-((comparison / 2) ** 2) / (2 * self.bw**2))
-        assert comparison.shape[:2] == (x.shape[0], y.shape[0])
+        assert comparison.shape[:2] == (x.shape[0], y.shape[0])     # pyright: ignore
         return comparison
 
 
@@ -318,7 +318,7 @@ def pre_gram_block(self, x: MatrixLike, y: MatrixLike) -> np.ndarray:
             comparison = np.expand_dims(comparison, -1)
 
         comparison = np.exp(-comparison / (2 * self.bw**2))
-        assert comparison.shape[:2] == (x.shape[0], y.shape[0])
+        assert comparison.shape[:2] == (x.shape[0], y.shape[0])     # pyright: ignore
         return comparison