(self)
Find any nodes in the graph that need to be added to the internal
        queue and add them.
Find any nodes in the graph that need to be added to the internal
        queue and add them.
Find any nodes in the graph that need to be added to the internal queue and add them .
def _find_new_additions(self) -> None:
        """Find any nodes in the graph that need to be added to the internal
        queue and add them.
        """
        for node, in_degree in self.graph.in_degree():
            if not self._already_known(node) and in_degree == 0:
                self.inner.put((self._scores[node], node))
                self.queued.add(node)
def _find_new_additions ( self ) -> None : for node , in_degree in self . graph . in_degree ( ) : if not self . _already_known ( node ) and in_degree == 0 : self . inner . put ( ( self . _scores [ node ] , node ) ) self . queued . add ( node )