code: def forw_dfs(self, start, end=None):
          
          return list(self.iterdfs(start, end, forward=True))
docs: Returns a list of nodes in some forward DFS order.
  
          Starting with the start node the depth first search proceeds along
          outgoing edges.