[Haskell-cafe] Re: Haskell-Cafe Digest, Vol 35, Issue 26

[Chad Scherrer]

On 7/12/06, henning thielemann wrote:

> There must be an algorithm for finding the minimal spanning tree or
> forest. The edges that do not belong to the tree should be the labelled as
> cycle-breakers.
>

Actually, I don't think that would do it, since you could have an
acyclic directed graph like this:

a -> b
|       |
\/     \/
c -> d

There are no cycles here, but the minimal spanning tree is not the whole thing.
-- 

Chad Scherrer

"Time flies like an arrow; fruit flies like a banana" -- Groucho Marx