Re: [Boost-Users] BGL: "Supergraphs?"

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-04-28 21:41:25

Hi Craig,

--On Sunday, April 28, 2002 11:55 AM +0900 hicks <hicks_at_[hidden]> wrote:
> To Mr. Greene
> 1. I could not find any reference to the subgraphs in the BGL
> documentation accompanying the boost library.
> Can you explain what you mean or where you found it?

http://www.boost.org/libs/graph/doc/subgraph.html

> To Mr. Siek
> 2.  Concerning Jeremey Siek's comments about virtually combining
> graph's, I included an excerpt from the BGL documentation
> at the bottom of this mail, which states that in order to "wrap" an
> existing graph (or suitable class) you need to overload
> all the free functions required by the interface which you will be using
> for that graph, an approach called "external interface".
>
> I suppose in a virtual combination of graphs, the graph object would be
> a container of sub-graphs, and
> that indices would be a pair, subgraph number + index. (for either
> vertices or edges).
> Its easy to imagine how the free functions could be overloaded easily
> using such an indexing system.
> So why should memory be consumed?

Sounds like an interesting approach. The challenge will be implementing an
efficient out_edge_iterator for this kind of graph.

> I find the BGL one of the most profoundly inspirational pieces of
> software I have ever seen.
> The flexibility offered by the use of property maps and the external
> interface approach
> are in and of themselves something to be admired.
> Thanks to the creators for their efforts.

Wow, thanks for the compliments!

Cheers,
Jeremy