@@ -344,7 +344,7 @@ def _compile_cost_edges(edge_map: Any) -> Tuple[Any, int]:
344344 edge_array = np .transpose (edge_nz )
345345 edge_array -= edge_center
346346 c_edges = ffi .new ("int[]" , len (edge_array ) * 3 )
347- edges = np .frombuffer (ffi .buffer (c_edges ), dtype = np .intc ).reshape (len (edge_array ), 3 ) # type: ignore
347+ edges = np .frombuffer (ffi .buffer (c_edges ), dtype = np .intc ).reshape (len (edge_array ), 3 )
348348 edges [:, :2 ] = edge_array
349349 edges [:, 2 ] = edge_map [edge_nz ]
350350 return c_edges , len (edge_array )
@@ -1148,7 +1148,7 @@ def traversal(self) -> NDArray[Any]:
11481148 """
11491149 if self ._order == "F" :
11501150 axes = range (self ._travel .ndim )
1151- return self ._travel .transpose ((* axes [- 2 ::- 1 ], axes [- 1 ]))[..., ::- 1 ] # type: ignore
1151+ return self ._travel .transpose ((* axes [- 2 ::- 1 ], axes [- 1 ]))[..., ::- 1 ]
11521152 return self ._travel
11531153
11541154 def clear (self ) -> None :
@@ -1320,7 +1320,7 @@ def path_from(self, index: Tuple[int, ...]) -> NDArray[Any]:
13201320 ffi .from_buffer ("int*" , path ),
13211321 )
13221322 )
1323- return path [:, ::- 1 ] if self ._order == "F" else path # type: ignore
1323+ return path [:, ::- 1 ] if self ._order == "F" else path
13241324
13251325 def path_to (self , index : Tuple [int , ...]) -> NDArray [Any ]:
13261326 """Return the shortest path from the nearest root to `index`.
@@ -1347,4 +1347,4 @@ def path_to(self, index: Tuple[int, ...]) -> NDArray[Any]:
13471347 >>> pf.path_to((0, 0))[1:].tolist() # Exclude the starting point so that a blocked path is an empty list.
13481348 []
13491349 """ # noqa: E501
1350- return self .path_from (index )[::- 1 ] # type: ignore
1350+ return self .path_from (index )[::- 1 ]
0 commit comments