From: Dave Abrahams (abrahams_at_[hidden])
Date: 2000-04-20 03:07:47
on 4/20/00 1:19 AM, David Bien at davidbien_at_[hidden] wrote:
> 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 ).
That work is not limited to undirected graphs. It isn't simple, but lots of
thought went into it. It really is worth understanding.
> 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 ?
Nope, just slap it in there. You can look at other boost copyright notices
for examples, if you want to be boost-compatible.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk