Корисник:KockaAdmiralac/Sandbox

TOP SORT ALL PATHS R(G)
if V = {} then
    return nil
end_if
return_paths = {}
for {n : (n ∈ V) and ((u, n) ∉ E)} do
    MARK_REMOVED(G, n)
    paths = TOP_SORT_ALL_PATHS_R(G)
    for path ∈ paths do
        new_path = GETNODE
        value(new_path) = n
        next(new_path) = path
        path = new_path
    end_for
    UNMARK_REMOVED(G, n)
    return_paths = return_paths + paths
end_for
return return_paths