Boost logo

Boost :

From: David Bien (davidbien_at_[hidden])
Date: 2000-04-20 01:19:36

--- In boost_at_[hidden], Dave Abrahams <abrahams_at_m...> wrote:
> I am very interested. A lot of work on this problem has already
taken place
> on the boost list, though, and there is already something in the
> (<>). I think some
fraction of the
> work in the vault doesn't conform to boost's requirements for free
> commercial use, so if your work could replace that part, it would
be great.
> I suggest you review the past postings on the subject and connect
> Dietmar Kuehl and Jeremy Siek, who did the bulk of the work.
Reviewing what is there, I see very little resemblance to my work,
which is specifically a directed graph. It is not meant to answer the
question "is this vertex connected to this vertex" in any particular
length of time. I would suggest that a dgraph may be a different
enough animal to have functionality and interfaces of its own
designed ( however similar they are to that of the undirected graph
implementation - any similarity being a good thing ). Anyway, I have
about 450k worth of code, I can make some minor changes to type names
and the like, but the architecture won't likely change much ( though
I certainly am open to any ideas/improvements ).
I'll get it out on anonymous ftp tomorrow.

How 'bout this question - can I copyright it by just putting a
copyright notice at the top of each source file?
Is there any authority that I need to notify ?

Thanks, Dave

Boost list run by bdawes at, gregod at, cpdaniel at, john at