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.
Something like
big_predicate = predicate1 || predicate2 || predicate3
(syntax should just illustrate the idea) maybe?