code: def descendants(self, full_table_name):
          
          nodes = self.subgraph(
              nx.algorithms.dag.descendants(self, full_table_name))
  
          return [full_table_name] + list(
              nx.algorithms.dag.topological_sort(nodes))
docs: :param full_table_name:  In form `schema`.`table_name`
          :return: all dependent tables sorted in topological order.  Self is included.