From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.comp.tex.context/6029 Path: main.gmane.org!not-for-mail From: Taco Hoekwater Newsgroups: gmane.comp.tex.context Subject: Re: How powerful is mp? Date: Thu, 8 Nov 2001 09:33:08 +0100 Sender: owner-ntg-context@let.uu.nl Message-ID: <20011108093308.7f315d4e.taco@elvenkind.com> References: <20011107123024.A3646@wimsey> <5.1.0.14.1.20011107183011.04289690@server-1> <20011107174952.A1358@wimsey> NNTP-Posting-Host: coloc-standby.netfonds.no Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit X-Trace: main.gmane.org 1035396581 6724 80.91.224.250 (23 Oct 2002 18:09:41 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Wed, 23 Oct 2002 18:09:41 +0000 (UTC) Cc: pragma@wxs.nl, ntg-context@ntg.nl Original-To: "Marco Kuhlmann" In-Reply-To: <20011107174952.A1358@wimsey> Xref: main.gmane.org gmane.comp.tex.context:6029 X-Report-Spam: http://spam.gmane.org/gmane.comp.tex.context:6029 "Marco Kuhlmann" wrote: > Hi Hans! > > Hans Hagen wrote (2001-11-07 (18:32)): > > > you want the simple binary trees graphics from the paper > > (incredible: after all these years people still post tex files > > with bitmaps) > > Not binary, n-ary trees. And what do you mean by the second > sentence? What TeX files, what bitmaps? The PDF of the paper is a TeX document processed with bitmap fonts. Incredibly ugly thing. > > i'm too stupid to read this kind of algorhitms so i would > > probably start from scratch -) > > I'm too stupid to come up with a better algorithm, so I would > probably try to implement Kennedy's! :-) Kennedy's implementation uses quadratic time. With all respect for the author himself, I think his article is not very exciting. He does indicate that the implementation can be changed to use linear time, but doesn't actually show the code that would result from that. That would have been a lot more interesting that a couple of recursive functional programming procedures that are all virtually trivial. Oh well. > > not too hard to do in xml i think [there is already an xml > > version of the context flowchart module] > > Do you think that this would be a good starting point for me > then? I don't think so. The cleanest way to build trees is bottom up, which is quite different from the flowchart approach. -- groeten, Taco