I've been catching up on things I meant to reply to weeks ago.
> > BTW, do you have any uses for [upwards and downwards
> > accumulations on trees]?
>
> I use
> flattenTree $ downAccuTree (flip (:)) [] $ spanningTree vertex graph
> to get paths from a graph vertex to every reachable vertex
Sorry, this was meant to go to the library list.
Am Mittwoch, 14. Januar 2004 10:55 schrieb Wolfgang Jeltsch:
> Am Dienstag, 13. Januar 2004 22:56 schrieb Ross Paterson:
> > On Tue, Jan 13, 2004 at 09:36:58PM +0100, Wolfgang Jeltsch wrote:
> > > Am Dienstag, 13. Januar 2004 19:12 schrieb Ross Pate
Am Dienstag, 13. Januar 2004 22:56 schrieb Ross Paterson:
> On Tue, Jan 13, 2004 at 09:36:58PM +0100, Wolfgang Jeltsch wrote:
> > Am Dienstag, 13. Januar 2004 19:12 schrieb Ross Paterson:
> > > * made the types abstract, but provided the equivalent constructor and
> > > destructor functions. I'm
Hello,
for my studies I recently needed graph and tree handling code. Because
nothing I found seemed to satisfy my needs, I finally started writing my own
graph and tree module. I was especially disappointed with Data.Graph and
Data.Tree. The reasons are:
* The Implementation of the type
