def get_group_tasks(self, group_name):
        rst = []
        predecessors = self.predecessors(group_name)
        for task in nx.topological_sort(self):

            if task not in predecessors:
                continue
            elif self.should_exclude_task(task):
                continue

            rst.append(self.node[task])
        return rst
dataset/ETHPy150Open openstack/fuel-web/nailgun/nailgun/orchestrator/orchestrator_graph.py/GraphSolver.get_group_tasks/original