[erlang-questions] graphs and trees

mats cronqvist mats.cronqvist@REDACTED
Mon Jan 7 10:31:56 CET 2008

On Tue, 2008-01-01 at 22:11 +0100, Torben Hoffmann wrote:
> On Dec 20, 2007 9:51 AM, mats cronqvist <mats.cronqvist@REDACTED>
> wrote:
>         is there some snazzy graph theory trick to show that a graph
>         is indeed a tree?
> Sorry for the late addition to the discussion (vacation clean-up of
> mailbox), but the Wikipedia article about Trees defines exactly the
> conditions for when a graph is indeed a tree:
> http://en.wikipedia.org/wiki/Tree_(graph_theory)
> Which approach that is the fastest depends on how the digraph module
> represents grahps - I have not had the courage to peek inside...

  wikipedia, eh? the 21st century rtfm...


More information about the erlang-questions mailing list