Fix issue with uneccessary iteration

Author: mikeshardmind

src/async_utils/_graphs.py

@@ -25,12 +25,12 @@
     class CanHashAndCompareLT(typing.Protocol):
         def __hash__(self) -> int: ...
 
-        def __lt__(self, other: typing.Self, /) -> bool: ...
+        def __lt__(self, other: typing.Any, /) -> bool: ...
 
     class CanHashAndCompareGT(typing.Protocol):
         def __hash__(self) -> int: ...
 
-        def __gt__(self, other: typing.Self, /) -> bool: ...
+        def __gt__(self, other: typing.Any, /) -> bool: ...
 
 else:
 
@@ -62,7 +62,7 @@ def cycle(self) -> list[T]:
         return self.args[0]
 
 
-class NodeData[T]:
+class NodeData[T: CanHashAndCompare]:
     __slots__ = ("dependants", "ndependencies", "node")
 
     def __init__(self, node: T) -> None:
@@ -74,6 +74,9 @@ def __init_subclass__(cls) -> t.Never:
         msg = "Don't subclass this"
         raise RuntimeError(msg)
 
+    def __lt__(self, other: t.Self) -> bool:  # falback for tuple sorting
+        return True
+
     __final__ = True
 
 
@@ -174,14 +177,15 @@ def __iter__(self) -> Generator[T, None, None]:
         return self.__iter()
 
     def __iter(self) -> Generator[T, None, None]:
-        while ready := [
-            i.node for i in self._nodemap.values() if not i.ndependencies
-        ]:
-            next_node = min(ready)
-            self._nodemap[next_node].ndependencies = -1
+        ready = [(n, i) for n, i in self._nodemap.items() if not i.ndependencies]
+        while ready:
+            next_node, info = min(ready)
+            info.ndependencies = -1
 
             yield next_node
 
-            for dep in self._nodemap[next_node].dependants:
+            for dep in info.dependants:
                 dep_info = self._nodemap[dep]
                 dep_info.ndependencies -= 1
+                if not dep_info.ndependencies:
+                    ready.append((dep, dep_info))