'Returns the feasible set of actions from the current node.'

def get_feasible_actions(self, node_ids):

    a = np.zeros((len(node_ids), self.task_params.num_actions), dtype=np.int32)
    gtG = self.task.gtG
    next_node = []
    for (i, c) in enumerate(node_ids):
        neigh = gtG.vertex(c).out_neighbours()
        neigh_edge = gtG.vertex(c).out_edges()
        nn = {}
        for (n, e) in zip(neigh, neigh_edge):
            _ = gtG.ep['action'][e]
            a[(i, _)] = 1
            nn[_] = int(n)
        next_node.append(nn)
    return (a, next_node)
