[erlang-questions] graphs and trees

Ignatios Souvatzis ignatios@REDACTED
Thu Dec 20 11:12:34 CET 2007

On Thu, Dec 20, 2007 at 01:23:35AM -0800, Thomas Lindgren wrote:
> Visit all nodes starting from the root, marking each
> node when visited. If you visit an already seen node,
> it's not a tree.
> If some node remains unmarked after this traversal,
> it's not a tree either. (It's not connected, or there
> is no unique root, or ...)

That is, it is a forest, right?


More information about the erlang-questions mailing list