Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2001
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Determining if a directed graph is a rooted tree

  • To: mathgroup at smc.vnet.net
  • Subject: [mg28413] Re: Determining if a directed graph is a rooted tree
  • From: "Seth Chandler" <SChandler at Central.UH.Edu>
  • Date: Mon, 16 Apr 2001 23:54:17 -0400 (EDT)
  • Organization: University of Houston
  • References: <9b8ogd$7eo@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

The wonderful built-in package DiscreteMath`Combinatorica has a function
TreeQ that should give you the answer. You will have to represent your
directed graph in the way the package desires, but this is rather
straightforward.

Seth J. Chandler
Assoc. Prof.
University of Houston Law Center

"Tony Duran" <radura0 at pop.uky.edu> wrote in message
news:9b8ogd$7eo at smc.vnet.net...
> Dear MathGroup,
>
> I'm trying to find an algorithm that will determine if a directed graph is
a
> rooted tree.  Does anybody have any ideas?
>
>
>




  • Prev by Date: NumberForm does not do, please help
  • Next by Date: conditionals during nonlinear regression
  • Previous by thread: NumberForm does not do, please help
  • Next by thread: Re: Determining if a directed graph is a rooted tree