Re:: [boost] graph-lib: sampling algorithms

From: Beman Dawes (bdawes_at_[hidden])
Date: 2001-07-13 09:44:36

At 10:00 AM 7/13/2001, Ruth Brown wrote:
 >
 >> I want to write some sampling algorithms for the graph lib, but I have
 >> difficulty understanding the code.
 >
 >Hi Ivo,
 >I don't know if this will help, but I've been looking at the
 >adjacency_list code and have diagrammed some of what I understand.
 >(I'm still pretty new to templates and generic programming, let alone
 >Boost.)  Let me know if the attached MSWord doc is at all helpful.

Since many Boost members don't have easy access to MS Word readers, and 
those that do worry about Word security issues, more widely supported 
formats like HTML and PDF are preferred.

Thanks,

--Beman