[Boost-users] [BGL] Searching for a convenient way to combine predicates for filtered_graph

Subject: [Boost-users] [BGL] Searching for a convenient way to combine predicates for filtered_graph
From: Cedric Laczny (cedric.laczny_at_[hidden])
Date: 2010-11-29 10:43:06

Hi,

I was wondering if there is a convenient (and to some extent intuitive) way to 
combine several predicates used in filtering a graph?
The idea is to have some predicates defined and arbitrarily combine them so 
that the filtered_graph will check for compliance of each individual predicate 
and either make this vertex/edge visible or not.
Of course, the predicates should be specific to vertices or edges, 
respectively, when being combined.
When using std::vector or such, they would need to be all of the same type 
which does not seem very nice/feasible IMHO.
Also defining a "big" predicate having a multitude of "smaller" predicates as 
members is not really an option as this is very restricted.
Something like
big_predicate = predicate1 || predicate2 || predicate3
(syntax should just illustrate the idea) maybe?

Best,

Cedric