From: Douglas Paul Gregor (gregod_at_[hidden])
Date: 2002-04-26 12:56:37
> I'd like to be able to take two independent BGL graphs and combine
> them into one graph such that there is a set of well-defined
> connections (i.e. it is easy for me to know what they should be)
> from one graph to the other. For me, it's usually just a single
> edge, but the ability to more generally add edges between the
> graphs would be useful -- there are other parts of my application
> that can make use of that.
This would be a useful capability for sure.
> But let me throw in the other twist: these independent graphs
> are actually filtered_graphs.
This isn't a twist in the BGL sense. A filtered_graph is just a graph
adaptor. It's no different conceptually from any other type of graph.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk