From: Dave Abrahams (abrahams_at_[hidden])
Date: 1999-12-11 00:19:26
> The handling of a list of nodes, edge, adjacent nodes, etc. can be
> done similarily. Only some basic operations should go into the
> general graph traits. Thinking of it, this is of course a reason
> to separate the source() and target() functions for an edge: There
> are graph representations supporting only one of them (the target()
> operation) but not the other... Thus, the pair idea I mentioned above
> is not really that clever (I left it in anyway so others don't have to
> go into this dead end).
Also, the names "first" and "second" aren't really good for anything. You're
thinking so fast that all I seem to be able to do is rein in your naming!
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk