Re: [boost] Boost Graph - internal datastructures of graph

From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2005-03-14 11:19:12

On Mar 6, 2005, at 5:45 PM, Peter Billen wrote:

> Hello all,
>
> I was wondering what internal datastructures are used in the different 
> graph
> concepts (Graph, IncidenceGraph, etc.), to achieve efficient 
> implementations of
> these different concepts. Is this documented somewhere?

The adjacency_list class template documentation discusses many of the 
tradeoffs when determining which underlying containers are used.

>  I couldn't find anything
> about the implementations on the website. Is this discussed in the 
> book? I am
> aware I can browse through the code, but I thought it might be a good 
> idea to
> ask it first here.

I don't recall any discussion like this in the book, but it could be 
there.

        Doug