- raise_rel_to_fun(+R, -F) is det
- R is assumed.
convert set R of links to a list F of successor lists.
In other words: F is a function derived from the relation R
such that F(x) = P (x in
dom(R)
) if P = { y | R(x,y)}
e.g. R=[a-b, a-c, b-d, b-e] => F=[a-[b,c], b-[d,e]]
Undocumented predicates
The following predicates are exported, but not or incorrectly documented.
- ends_frontier(Arg1)
- rect_links(Arg1, Arg2)
- prepare_udg(Arg1)
- prepare_udg(Arg1, Arg2)
- prepare_udg_normal(Arg1)
- prepare_udg_normal(Arg1, Arg2)
- prepare_udg_reverse(Arg1)
- prepare_udg_reverse(Arg1, Arg2)
- normal_pair(Arg1, Arg2)
- end_node(Arg1)
- on_pair(Arg1, Arg2)
- off_pair(Arg1, Arg2)
- intern_node_id(Arg1, Arg2)
- setup_frontier_min(Arg1, Arg2)
- setup_frontier_max(Arg1, Arg2)
- show_udg
- show_udg_st
- setup_prune_vector(Arg1)