MathGroup Archive 1999

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

Search the Archive

Re: Making a plot of a tree structure

  • To: mathgroup at smc.vnet.net
  • Subject: [mg17378] Re: Making a plot of a tree structure
  • From: Paul Abbott <paul at physics.uwa.edu.au>
  • Date: Thu, 6 May 1999 02:44:04 -0400
  • Organization: University of Western Australia
  • References: <7gfsbb$6fl@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

Philip M. Howe wrote:

> My code parcel that generates lists of this type actually produces a very
> highly nested list.  I have used Flatten and Partition to generate the list
> of x-y pairs shown above. Conceptually,this simple list actually started
> as a list of three lists, one with its origin at {0,0}, one with its origin
> {.04,.06}, which is a point on the first list, and one with its origin
> {.22,.15}, which is also a point on the first list.
> 
> If I use
> 
>         Show[Graphics[Line[mylist]]];
> 
> the plot actually forms loops. I would rather have it look like a tree, or
> a walk with two other walks branching from it. 

I think that you'll find a partial answer to your question using the
DiscreteMath`Tree` package.

Cheers,
	Paul
 
____________________________________________________________________ 
Paul Abbott                                   Phone: +61-8-9380-2734
Department of Physics                           Fax: +61-8-9380-1014
The University of Western Australia           
Nedlands WA  6907                     mailto:paul at physics.uwa.edu.au 
AUSTRALIA                        http://www.physics.uwa.edu.au/~paul

            God IS a weakly left-handed dice player
____________________________________________________________________


  • Prev by Date: Re: Change the Color of Graphics
  • Next by Date: Re: Horner's method on subexpressions
  • Previous by thread: Making a plot of a tree structure
  • Next by thread: RE: ListPlot3D again