Boost logo

Boost :

From: Peter Billen (peter_at_[hidden])
Date: 2005-03-06 17:45:19

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? 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.

Thanks for your replies,


Boost list run by bdawes at, gregod at, cpdaniel at, john at