[BGL] Finding out what properties exist in a graph?
Is there an easy way to find out all of, for instance, the vertex properties associated with a graph? What I'm looking for is something like the following: <pseduocode> vector<properties> my_vertex_properties; property_iterator pi, last; for(tie(pi, last) = vertex_property_list(Graph); pi != last; ++pi) my_vertex_properties.push_back(*pi); </pseudocode> How about it? Does anything like this exist or am I just daydreaming again? Thanks. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706
Hi Steve, You're daydreaming ;) Out of curiosity, what do you imagine doing with the my_vertex_properties vector? What operations on the type "properties" do you see yourself using? Cheers, Jeremy On Mar 30, 2004, at 11:33 AM, Steve Juranich wrote:
Is there an easy way to find out all of, for instance, the vertex properties associated with a graph? What I'm looking for is something like the following:
<pseduocode> vector<properties> my_vertex_properties; property_iterator pi, last; for(tie(pi, last) = vertex_property_list(Graph); pi != last; ++pi) my_vertex_properties.push_back(*pi); </pseudocode>
How about it? Does anything like this exist or am I just daydreaming again?
Thanks. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706 _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
_______________________________________________ Jeremy Siek <jsiek@osl.iu.edu> http://www.osl.iu.edu/~jsiek Ph.D. Student, Indiana University Bloomington Graduating in August 2004 and looking for work C++ Booster (http://www.boost.org) _______________________________________________
On Tue, 30 Mar 2004, Jeremy Siek wrote:
You're daydreaming ;)
Rats. But that's kind of what I thought.
Out of curiosity, what do you imagine doing with the my_vertex_properties vector? What operations on the type "properties" do you see yourself using?
Well, one thing that I'm dealing with right now is an easy way to map a graph with arbitrary properties to a GraphvizDigraph and vice versa (for I/O). But the more I look at this, the more I'm convinced that I'm probably thinking about this the wrong way. Anyway, this might be a good thing for the "wishlist". Thanks. -- Stephen W. Juranich Science Applications Intl. Corp. (SAIC) (520) 570-7706
participants (2)
-
Jeremy Siek -
Steve Juranich