docs: def back_dfs(self, start, end=None):
          """
          Returns a list of nodes in some backward DFS order.
  
          Starting from the start node the depth first search proceeds along
          incoming edges.
          """
          return list(self.iterdfs(start, end, forward=False))