[BGL] Determining if a graph has a particular internal property?
Is this possible? A well-defined return type from get(p, g) when p is not an internal property of graph g would suffice. Doug
Hi Doug, There's the vertex_property<Graph>::type and edge_property<Graph>::type meta-functions which return the property list. You can then use the property_value meta-function on the result, and if that returns error_property_not_found, you know it is not there. The online docs for PropertyGraph and MutablePropertyGraph look a bit out of date, and need to be sync'd with the graph_concepts.hpp. Cheers, Jeremy On Mar 14, 2004, at 7:00 PM, Douglas Gregor wrote:
Is this possible? A well-defined return type from get(p, g) when p is not an internal property of graph g would suffice.
Doug _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
On Mon, 15 Mar 2004, Jeremy Siek wrote:
Hi Doug,
There's the vertex_property<Graph>::type and edge_property<Graph>::type meta-functions which return the property list. You can then use the property_value meta-function on the result, and if that returns error_property_not_found, you know it is not there.
Ah ha! I see it now. Thanks! Doug
participants (3)
-
Douglas Gregor
-
Douglas Paul Gregor
-
Jeremy Siek