Hello,<br />I'm working in a graph algorithm that works on graphs that implement<br />&nbsp;BidirectionalGraphConcept and
VertexAndEdgeListGraphConcept.<br />The only additional requirement is that they must have some concrete bundled properties<br />(I don't want to
deal with the, I understand old, method of defining properties).<br />For example, if g is a graph and v is a valid vertex descriptor of that
graph,<br /><br />g[v].min<br /><br />must be a valid boolean expression.<br />I have defined template classes for those bundled properties, but I
wish not to impose using those concrete classes.<br />To do so, I never get g[v] in a variable to later access the properties. For example, I always
write<br /><br />g[v].min<br /><br />instead of something like<br /><br />BundledVertexPropertyType &amp;p=g[v];<br />p.min<br /><br />Ok, for the
moment.<br />The problem is that, at some point of my algorithm (concretely when wanting to invoke the topological_sort<br />BGL algorithm) I must
have knowledge of what's the concrete type of the bundled properties<br />(i.e., I need to know that BundledVertexPropertyType written before).<br
/>I can't find in BGL documentation a way to do that. I look, for example, for something like, imagine,<br /><br
/>graph_traits&lt;Graph&gt;::bundled_vertex_properties_type<br /><br />Is there a documented way to achieve that?<br />If not, is there any way how
I can get a property map to provide access to a bundled property without knowing the bundled-property type?<br />Right now I'm using an expression
like the following one:<br /><br />get(&amp;BundledVertexPropertyType::index,g)<br /><br />But this obviously requires knowing the
BundledVertexPropertyType when writing the code. Is there any way to avoid it?<br /><br />Thanks a lot,<br /><br />Juan