clean up descendents algorithm

Tony Crisci · Tony Crisci · commit e51b0918ca1e · 2017-09-14T18:18:04.000-04:00
diff --git a/i3ipc/i3ipc.py b/i3ipc/i3ipc.py
@@ -880,14 +880,11 @@ def __iter__(self):
         """
         Iterate through the descendents of this node (breadth-first tree traversal)
         """
-        queue = deque()
-        queue.append(self)
+        queue = deque(self.nodes)
 
         while queue:
             con = queue.popleft()
-            if not con is self:
-                yield con
-
+            yield con
             queue.extend(con.nodes)
 
     def root(self):
