Boost logo

Boost Users :

Subject: Re: [Boost-users] BGL - accessing component subgraphs.
From: Adam Spargo (aws_at_[hidden])
Date: 2010-07-20 11:33:16


> You don't need the edge predicate if you're using an induced subgraph (which
> I believe you are). Filtering the endpoints of an edge to ensure that both
> vertices are present in the filtered graph is done automatically no matter
> what edge predicate you use, so keep_all will work for what you want to do.

Yes, that works, thanks for your help. Final toy example attached in case
it's useful for somebody else.

Cheers,

Adam.

-- 
 The Wellcome Trust Sanger Institute is operated by Genome Research 
 Limited, a charity registered in England with number 1021457 and a 
 company registered in England with number 2742969, whose registered 
 office is 215 Euston Road, London, NW1 2BE. 



Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net