graph theory : find all successors of a node

progeny.sce

function LD = descendants (Pred, x)
    count =  length(Pred)
    LD = []
    for k=1:count
        if (find(chemin_arbre(Pred, k)==x)~=[]) then
            LD = [LD, k]
        end
    end
endfunction

// parcours en largeur
function LD = descendants_bis(Pred, x)
    new = fils(Pred, x)
    old = []
    while (new ~= [])
        new = [new, fils(Pred, new(1))]
        old = [old, new(1)]
        new(1) = []
    end
    LD = old
endfunction