[erlang-questions] graphs and trees

[Richard Carlsson]

mats cronqvist wrote:
>   so i've made a directad acyclic graph by calling various functions in
> the digraph module. i theory, the resulting graph should be a tree. is
> there some snazzy graph theory trick to show that the graph is indeed a
> tree?

Suggestion: when you have a working test, call it is_tree(G) and
submit it to OTP as a patch to digraph_utils.

     /Richard