(self)
return len(self) == 0
The graph queue is 'empty' if it all remaining nodes in the graph
        are in progress.

        This takes the lock.
The graph queue is 'empty' if it all remaining nodes in the graph
        are in progress.
The graph queue is empty if it all remaining nodes in the graph are in progress .
def empty(self) -> bool:
        """The graph queue is 'empty' if it all remaining nodes in the graph
        are in progress.

        This takes the lock.
        """
        return len(self) == 0
def empty ( self ) -> bool : return len ( self ) == 0